./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-13 23:12:05,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:12:05,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:12:05,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:12:05,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:12:05,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:12:05,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:12:05,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:12:05,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:12:05,226 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:12:05,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:12:05,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:12:05,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:12:05,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:12:05,231 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:12:05,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:12:05,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:12:05,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:12:05,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:12:05,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:12:05,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:12:05,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:12:05,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:12:05,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:12:05,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:12:05,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:12:05,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:12:05,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:12:05,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:12:05,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:12:05,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:12:05,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:12:05,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:12:05,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:12:05,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:12:05,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:12:05,255 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 23:12:05,279 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:12:05,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:12:05,281 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:12:05,281 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:12:05,281 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:12:05,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:12:05,282 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:12:05,282 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:12:05,282 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:12:05,282 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:12:05,282 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:12:05,283 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:12:05,283 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:12:05,283 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:12:05,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:12:05,283 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:12:05,283 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:12:05,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:12:05,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:12:05,285 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:12:05,286 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:12:05,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:12:05,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:12:05,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:12:05,286 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 23:12:05,287 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:12:05,288 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-13 23:12:05,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:12:05,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:12:05,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:12:05,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:12:05,342 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:12:05,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2019-01-13 23:12:05,400 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d4ca9e7/de1728eb419b48d9b211b9fcdceea257/FLAGbee8f4480 [2019-01-13 23:12:05,970 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:12:05,973 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2019-01-13 23:12:05,988 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d4ca9e7/de1728eb419b48d9b211b9fcdceea257/FLAGbee8f4480 [2019-01-13 23:12:06,236 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d4ca9e7/de1728eb419b48d9b211b9fcdceea257 [2019-01-13 23:12:06,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:12:06,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:12:06,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:12:06,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:12:06,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:12:06,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:12:06" (1/1) ... [2019-01-13 23:12:06,249 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 13.01 11:12:06, skipping insertion in model container [2019-01-13 23:12:06,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:12:06" (1/1) ... [2019-01-13 23:12:06,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:12:06,326 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:12:06,833 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:12:06,957 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:12:07,072 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:12:07,159 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:12:07,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07 WrapperNode [2019-01-13 23:12:07,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:12:07,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:12:07,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:12:07,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:12:07,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (1/1) ... [2019-01-13 23:12:07,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (1/1) ... [2019-01-13 23:12:07,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (1/1) ... [2019-01-13 23:12:07,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (1/1) ... [2019-01-13 23:12:07,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (1/1) ... [2019-01-13 23:12:07,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (1/1) ... [2019-01-13 23:12:07,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (1/1) ... [2019-01-13 23:12:07,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:12:07,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:12:07,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:12:07,308 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:12:07,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (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-13 23:12:07,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:12:07,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:12:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 23:12:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 23:12:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 23:12:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-13 23:12:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-13 23:12:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-13 23:12:07,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-13 23:12:07,373 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-13 23:12:07,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-13 23:12:07,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-13 23:12:07,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-13 23:12:07,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-13 23:12:07,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-13 23:12:07,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-13 23:12:07,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-13 23:12:07,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-13 23:12:07,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-13 23:12:07,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-13 23:12:07,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-13 23:12:07,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-13 23:12:07,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-13 23:12:07,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-13 23:12:07,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-13 23:12:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-13 23:12:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-13 23:12:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-13 23:12:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-13 23:12:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-13 23:12:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-13 23:12:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-13 23:12:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-13 23:12:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-13 23:12:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-13 23:12:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-13 23:12:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-13 23:12:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-13 23:12:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-01-13 23:12:07,379 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2019-01-13 23:12:07,381 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-13 23:12:07,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:12:07,381 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-13 23:12:07,381 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-13 23:12:07,382 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-13 23:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 23:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 23:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:12:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:12:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:12:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:12:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:12:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:12:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:12:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:12:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:12:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:12:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:12:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:12:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:12:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:12:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:12:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:12:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:12:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:12:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:12:07,387 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:12:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:12:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:12:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:12:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:12:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:12:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:12:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:12:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:12:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:12:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:12:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:12:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:12:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:12:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:12:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:12:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:12:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:12:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:12:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:12:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:12:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:12:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:12:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:12:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:12:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:12:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:12:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:12:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:12:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:12:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:12:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:12:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:12:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:12:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:12:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:12:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:12:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:12:07,397 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:12:07,399 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:12:07,399 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:12:07,399 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:12:07,399 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:12:07,399 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:12:07,400 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:12:07,400 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:12:07,401 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:12:07,401 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:12:07,401 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:12:07,401 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:12:07,401 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:12:07,401 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:12:07,401 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:12:07,401 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:12:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:12:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:12:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:12:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:12:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:12:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:12:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:12:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:12:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:12:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:12:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:12:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:12:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:12:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:12:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:12:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-13 23:12:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:12:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-13 23:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-13 23:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-13 23:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-13 23:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-13 23:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-13 23:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-13 23:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-13 23:12:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-13 23:12:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:12:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-13 23:12:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-13 23:12:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-13 23:12:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:12:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-13 23:12:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-13 23:12:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-13 23:12:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-13 23:12:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-13 23:12:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-13 23:12:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:12:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-13 23:12:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 23:12:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-13 23:12:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-13 23:12:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-13 23:12:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-13 23:12:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-13 23:12:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-13 23:12:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-01-13 23:12:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2019-01-13 23:12:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-13 23:12:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:12:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:12:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 23:12:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 23:12:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:12:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-13 23:12:07,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-13 23:12:07,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-13 23:12:07,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-13 23:12:08,126 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 23:12:08,793 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 23:12:09,336 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:12:09,337 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 23:12:09,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:12:09 BoogieIcfgContainer [2019-01-13 23:12:09,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:12:09,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:12:09,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:12:09,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:12:09,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:12:06" (1/3) ... [2019-01-13 23:12:09,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afa2a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:12:09, skipping insertion in model container [2019-01-13 23:12:09,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:12:07" (2/3) ... [2019-01-13 23:12:09,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afa2a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:12:09, skipping insertion in model container [2019-01-13 23:12:09,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:12:09" (3/3) ... [2019-01-13 23:12:09,346 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_true-valid-memsafety.i [2019-01-13 23:12:09,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:12:09,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-01-13 23:12:09,385 INFO L257 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-01-13 23:12:09,415 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:12:09,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:12:09,416 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:12:09,416 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:12:09,416 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:12:09,416 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:12:09,416 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:12:09,417 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:12:09,418 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:12:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-13 23:12:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:12:09,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:09,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:12:09,459 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:09,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1566870466, now seen corresponding path program 1 times [2019-01-13 23:12:09,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:09,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:09,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:10,243 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-13 23:12:10,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:10,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:12:10,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:12:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:12:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:12:10,263 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 8 states. [2019-01-13 23:12:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:11,889 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2019-01-13 23:12:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:12:11,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-13 23:12:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:11,906 INFO L225 Difference]: With dead ends: 157 [2019-01-13 23:12:11,906 INFO L226 Difference]: Without dead ends: 150 [2019-01-13 23:12:11,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:12:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-13 23:12:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2019-01-13 23:12:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-13 23:12:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-01-13 23:12:11,962 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 17 [2019-01-13 23:12:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:11,963 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-01-13 23:12:11,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:12:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-01-13 23:12:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:12:11,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:11,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:12:11,965 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1566870467, now seen corresponding path program 1 times [2019-01-13 23:12:11,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:11,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:11,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:12,170 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-13 23:12:12,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:12,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:12:12,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:12:12,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:12:12,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:12:12,173 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2019-01-13 23:12:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:13,126 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-13 23:12:13,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:12:13,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-13 23:12:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:13,130 INFO L225 Difference]: With dead ends: 112 [2019-01-13 23:12:13,130 INFO L226 Difference]: Without dead ends: 112 [2019-01-13 23:12:13,131 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-13 23:12:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-13 23:12:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-01-13 23:12:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-13 23:12:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-13 23:12:13,143 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2019-01-13 23:12:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:13,143 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-13 23:12:13,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:12:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-13 23:12:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 23:12:13,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:13,145 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-13 23:12:13,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash 933847132, now seen corresponding path program 1 times [2019-01-13 23:12:13,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:13,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:13,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:13,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-13 23:12:13,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:13,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:12:13,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:12:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:12:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:12:13,356 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 8 states. [2019-01-13 23:12:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:13,846 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2019-01-13 23:12:13,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:12:13,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-01-13 23:12:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:13,851 INFO L225 Difference]: With dead ends: 150 [2019-01-13 23:12:13,851 INFO L226 Difference]: Without dead ends: 150 [2019-01-13 23:12:13,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-13 23:12:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-13 23:12:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 106. [2019-01-13 23:12:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-13 23:12:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-01-13 23:12:13,863 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 20 [2019-01-13 23:12:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:13,863 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-01-13 23:12:13,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:12:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-01-13 23:12:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 23:12:13,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:13,865 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-13 23:12:13,865 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash 933847133, now seen corresponding path program 1 times [2019-01-13 23:12:13,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:13,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:13,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:13,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:14,269 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-13 23:12:14,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:14,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 23:12:14,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 23:12:14,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 23:12:14,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:12:14,271 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 11 states. [2019-01-13 23:12:14,757 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-13 23:12:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:15,702 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2019-01-13 23:12:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 23:12:15,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-13 23:12:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:15,706 INFO L225 Difference]: With dead ends: 148 [2019-01-13 23:12:15,706 INFO L226 Difference]: Without dead ends: 148 [2019-01-13 23:12:15,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-01-13 23:12:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-13 23:12:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 105. [2019-01-13 23:12:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-13 23:12:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-01-13 23:12:15,719 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2019-01-13 23:12:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:15,720 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-01-13 23:12:15,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 23:12:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-01-13 23:12:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:12:15,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:15,721 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-13 23:12:15,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:15,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1115509935, now seen corresponding path program 1 times [2019-01-13 23:12:15,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:15,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:15,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:15,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:15,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:15,863 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-13 23:12:15,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:15,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 23:12:15,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 23:12:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 23:12:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:12:15,864 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2019-01-13 23:12:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:16,177 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-01-13 23:12:16,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:12:16,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-13 23:12:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:16,181 INFO L225 Difference]: With dead ends: 121 [2019-01-13 23:12:16,181 INFO L226 Difference]: Without dead ends: 121 [2019-01-13 23:12:16,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:12:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-13 23:12:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-13 23:12:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-13 23:12:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-01-13 23:12:16,190 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 21 [2019-01-13 23:12:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:16,190 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-01-13 23:12:16,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 23:12:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-01-13 23:12:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:12:16,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:16,191 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-13 23:12:16,192 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1115509934, now seen corresponding path program 1 times [2019-01-13 23:12:16,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:16,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:16,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:16,551 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-13 23:12:16,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:16,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 23:12:16,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:12:16,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:12:16,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:12:16,553 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 10 states. [2019-01-13 23:12:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:16,983 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-01-13 23:12:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:12:16,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-01-13 23:12:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:16,987 INFO L225 Difference]: With dead ends: 119 [2019-01-13 23:12:16,988 INFO L226 Difference]: Without dead ends: 119 [2019-01-13 23:12:16,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-13 23:12:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-13 23:12:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-01-13 23:12:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-13 23:12:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-01-13 23:12:16,995 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 21 [2019-01-13 23:12:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:16,995 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-01-13 23:12:16,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:12:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-01-13 23:12:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:12:16,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:16,997 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-13 23:12:16,997 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:16,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash -986427216, now seen corresponding path program 1 times [2019-01-13 23:12:16,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:16,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:16,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:16,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:17,129 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-13 23:12:17,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:17,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:12:17,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:12:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:12:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:12:17,132 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 5 states. [2019-01-13 23:12:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:17,184 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-01-13 23:12:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:12:17,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-13 23:12:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:17,186 INFO L225 Difference]: With dead ends: 102 [2019-01-13 23:12:17,186 INFO L226 Difference]: Without dead ends: 102 [2019-01-13 23:12:17,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:12:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-13 23:12:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-01-13 23:12:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-13 23:12:17,192 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 21 [2019-01-13 23:12:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:17,193 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-13 23:12:17,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:12:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-13 23:12:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:12:17,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:17,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] [2019-01-13 23:12:17,194 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash -16522430, now seen corresponding path program 1 times [2019-01-13 23:12:17,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:17,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:17,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:17,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:17,428 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-13 23:12:17,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:17,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:12:17,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:12:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:12:17,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:12:17,430 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2019-01-13 23:12:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:17,542 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-01-13 23:12:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:12:17,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-13 23:12:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:17,546 INFO L225 Difference]: With dead ends: 100 [2019-01-13 23:12:17,546 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 23:12:17,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:12:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 23:12:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-13 23:12:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-13 23:12:17,564 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 21 [2019-01-13 23:12:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:17,564 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-13 23:12:17,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:12:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-13 23:12:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:12:17,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:17,568 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-13 23:12:17,568 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash 112560289, now seen corresponding path program 1 times [2019-01-13 23:12:17,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:17,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:17,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:17,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:17,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:17,860 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-13 23:12:17,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:17,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:12:17,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:12:17,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:12:17,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:12:17,861 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 6 states. [2019-01-13 23:12:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:18,213 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-01-13 23:12:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:12:18,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-13 23:12:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:18,217 INFO L225 Difference]: With dead ends: 137 [2019-01-13 23:12:18,217 INFO L226 Difference]: Without dead ends: 135 [2019-01-13 23:12:18,217 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-13 23:12:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-13 23:12:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-01-13 23:12:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-13 23:12:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-01-13 23:12:18,224 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2019-01-13 23:12:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:18,224 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-01-13 23:12:18,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:12:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-01-13 23:12:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:12:18,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:18,226 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-13 23:12:18,226 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:18,227 INFO L82 PathProgramCache]: Analyzing trace with hash 112560290, now seen corresponding path program 1 times [2019-01-13 23:12:18,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:18,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:18,417 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 23:12:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:12:18,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:18,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:12:18,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:12:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:12:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:12:18,486 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 7 states. [2019-01-13 23:12:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:19,966 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2019-01-13 23:12:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:12:19,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-13 23:12:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:19,969 INFO L225 Difference]: With dead ends: 134 [2019-01-13 23:12:19,969 INFO L226 Difference]: Without dead ends: 134 [2019-01-13 23:12:19,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:12:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-13 23:12:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2019-01-13 23:12:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-13 23:12:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-01-13 23:12:19,974 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2019-01-13 23:12:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:19,975 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-01-13 23:12:19,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:12:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-01-13 23:12:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 23:12:19,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:19,976 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-13 23:12:19,976 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:19,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1736778004, now seen corresponding path program 1 times [2019-01-13 23:12:19,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:19,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:19,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:19,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:19,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:20,067 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-13 23:12:20,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:20,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:12:20,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:12:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:12:20,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:12:20,069 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 5 states. [2019-01-13 23:12:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:20,213 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-01-13 23:12:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:12:20,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-13 23:12:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:20,216 INFO L225 Difference]: With dead ends: 114 [2019-01-13 23:12:20,216 INFO L226 Difference]: Without dead ends: 114 [2019-01-13 23:12:20,217 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-13 23:12:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-13 23:12:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-13 23:12:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-13 23:12:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-13 23:12:20,221 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 23 [2019-01-13 23:12:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:20,222 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-13 23:12:20,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:12:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-01-13 23:12:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 23:12:20,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:20,223 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-13 23:12:20,224 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:20,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1736778005, now seen corresponding path program 1 times [2019-01-13 23:12:20,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:20,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:20,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:20,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:20,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:20,427 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-13 23:12:20,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:20,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 23:12:20,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:12:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:12:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:12:20,429 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 10 states. [2019-01-13 23:12:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:20,847 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2019-01-13 23:12:20,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:12:20,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-13 23:12:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:20,851 INFO L225 Difference]: With dead ends: 129 [2019-01-13 23:12:20,851 INFO L226 Difference]: Without dead ends: 129 [2019-01-13 23:12:20,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:12:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-13 23:12:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2019-01-13 23:12:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-13 23:12:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2019-01-13 23:12:20,857 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 23 [2019-01-13 23:12:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:20,857 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2019-01-13 23:12:20,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:12:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2019-01-13 23:12:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 23:12:20,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:20,858 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-13 23:12:20,859 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash 439072057, now seen corresponding path program 1 times [2019-01-13 23:12:20,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:20,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:20,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:20,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:20,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:20,933 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-13 23:12:20,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:20,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:12:20,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:12:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:12:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:12:20,935 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 5 states. [2019-01-13 23:12:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:21,295 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-01-13 23:12:21,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:12:21,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-13 23:12:21,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:21,298 INFO L225 Difference]: With dead ends: 125 [2019-01-13 23:12:21,299 INFO L226 Difference]: Without dead ends: 125 [2019-01-13 23:12:21,299 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-13 23:12:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-13 23:12:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2019-01-13 23:12:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-13 23:12:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-01-13 23:12:21,306 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 26 [2019-01-13 23:12:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:21,307 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-01-13 23:12:21,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:12:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-01-13 23:12:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 23:12:21,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:21,308 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-13 23:12:21,308 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash 439072058, now seen corresponding path program 1 times [2019-01-13 23:12:21,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:21,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:21,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:21,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:21,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:21,471 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 23:12:21,587 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-13 23:12:21,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:21,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:12:21,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:12:21,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:12:21,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:12:21,589 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 7 states. [2019-01-13 23:12:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:22,064 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-01-13 23:12:22,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:12:22,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-13 23:12:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:22,067 INFO L225 Difference]: With dead ends: 123 [2019-01-13 23:12:22,067 INFO L226 Difference]: Without dead ends: 123 [2019-01-13 23:12:22,067 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-13 23:12:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-13 23:12:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-01-13 23:12:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-13 23:12:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-01-13 23:12:22,073 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 26 [2019-01-13 23:12:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:22,074 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-01-13 23:12:22,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:12:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-01-13 23:12:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 23:12:22,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:22,075 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-13 23:12:22,075 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash 917142671, now seen corresponding path program 1 times [2019-01-13 23:12:22,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:22,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:22,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:22,261 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-13 23:12:22,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:22,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:12:22,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:12:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:12:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:12:22,262 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 6 states. [2019-01-13 23:12:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:22,515 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-01-13 23:12:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:12:22,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-13 23:12:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:22,518 INFO L225 Difference]: With dead ends: 143 [2019-01-13 23:12:22,518 INFO L226 Difference]: Without dead ends: 143 [2019-01-13 23:12:22,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:12:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-13 23:12:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2019-01-13 23:12:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-13 23:12:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-01-13 23:12:22,531 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 28 [2019-01-13 23:12:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:22,531 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-01-13 23:12:22,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:12:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-01-13 23:12:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 23:12:22,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:22,532 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-13 23:12:22,533 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 917142672, now seen corresponding path program 1 times [2019-01-13 23:12:22,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:22,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:22,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:22,762 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-13 23:12:22,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:22,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:12:22,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:12:22,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:12:22,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:12:22,765 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 6 states. [2019-01-13 23:12:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:23,110 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-01-13 23:12:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:12:23,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-13 23:12:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:23,114 INFO L225 Difference]: With dead ends: 129 [2019-01-13 23:12:23,115 INFO L226 Difference]: Without dead ends: 110 [2019-01-13 23:12:23,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:12:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-13 23:12:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-13 23:12:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-13 23:12:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-01-13 23:12:23,121 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 28 [2019-01-13 23:12:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:23,121 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-01-13 23:12:23,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:12:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-01-13 23:12:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 23:12:23,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:23,122 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-13 23:12:23,127 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 179612576, now seen corresponding path program 1 times [2019-01-13 23:12:23,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:23,302 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-13 23:12:23,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:23,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:12:23,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:12:23,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:12:23,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:12:23,304 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2019-01-13 23:12:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:23,835 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-01-13 23:12:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 23:12:23,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-01-13 23:12:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:23,838 INFO L225 Difference]: With dead ends: 121 [2019-01-13 23:12:23,838 INFO L226 Difference]: Without dead ends: 121 [2019-01-13 23:12:23,839 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-13 23:12:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-13 23:12:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2019-01-13 23:12:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-13 23:12:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-13 23:12:23,843 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 35 [2019-01-13 23:12:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:23,843 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-13 23:12:23,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:12:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-13 23:12:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 23:12:23,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:23,844 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-13 23:12:23,845 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash 179612577, now seen corresponding path program 1 times [2019-01-13 23:12:23,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:23,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:23,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:23,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:24,232 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-13 23:12:24,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:24,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 23:12:24,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 23:12:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 23:12:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-13 23:12:24,233 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 13 states. [2019-01-13 23:12:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:24,884 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2019-01-13 23:12:24,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 23:12:24,885 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-01-13 23:12:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:24,887 INFO L225 Difference]: With dead ends: 116 [2019-01-13 23:12:24,887 INFO L226 Difference]: Without dead ends: 116 [2019-01-13 23:12:24,888 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-13 23:12:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-13 23:12:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2019-01-13 23:12:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 23:12:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-13 23:12:24,892 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 35 [2019-01-13 23:12:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:24,892 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-13 23:12:24,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 23:12:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-13 23:12:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-13 23:12:24,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:24,895 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-13 23:12:24,896 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1970641307, now seen corresponding path program 1 times [2019-01-13 23:12:24,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:24,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:24,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:24,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:24,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:25,408 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-13 23:12:25,596 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-13 23:12:25,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:25,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-13 23:12:25,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 23:12:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 23:12:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:12:25,598 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 16 states. [2019-01-13 23:12:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:26,376 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-01-13 23:12:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 23:12:26,377 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-01-13 23:12:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:26,379 INFO L225 Difference]: With dead ends: 114 [2019-01-13 23:12:26,379 INFO L226 Difference]: Without dead ends: 114 [2019-01-13 23:12:26,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-01-13 23:12:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-13 23:12:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-01-13 23:12:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 23:12:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-01-13 23:12:26,383 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 40 [2019-01-13 23:12:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:26,385 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-01-13 23:12:26,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 23:12:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-01-13 23:12:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 23:12:26,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:26,386 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-13 23:12:26,389 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash -418591567, now seen corresponding path program 1 times [2019-01-13 23:12:26,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:26,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:26,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:26,786 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-13 23:12:26,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:26,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-13 23:12:26,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 23:12:26,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 23:12:26,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-01-13 23:12:26,788 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 17 states. [2019-01-13 23:12:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:27,789 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-13 23:12:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 23:12:27,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-01-13 23:12:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:27,791 INFO L225 Difference]: With dead ends: 106 [2019-01-13 23:12:27,791 INFO L226 Difference]: Without dead ends: 106 [2019-01-13 23:12:27,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 23:12:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-13 23:12:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2019-01-13 23:12:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-01-13 23:12:27,800 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 42 [2019-01-13 23:12:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:27,801 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-01-13 23:12:27,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 23:12:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-01-13 23:12:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 23:12:27,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:27,802 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-13 23:12:27,802 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 671545618, now seen corresponding path program 1 times [2019-01-13 23:12:27,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:27,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:27,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:27,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:27,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:28,844 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-13 23:12:28,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:28,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-01-13 23:12:28,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-13 23:12:28,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-13 23:12:28,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2019-01-13 23:12:28,847 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 24 states. [2019-01-13 23:12:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:30,563 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-01-13 23:12:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-13 23:12:30,565 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-01-13 23:12:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:30,566 INFO L225 Difference]: With dead ends: 103 [2019-01-13 23:12:30,566 INFO L226 Difference]: Without dead ends: 103 [2019-01-13 23:12:30,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=235, Invalid=1835, Unknown=0, NotChecked=0, Total=2070 [2019-01-13 23:12:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-13 23:12:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-01-13 23:12:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-13 23:12:30,570 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 44 [2019-01-13 23:12:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:30,570 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-13 23:12:30,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-13 23:12:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-13 23:12:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 23:12:30,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:30,571 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-13 23:12:30,572 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:30,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash 671545619, now seen corresponding path program 1 times [2019-01-13 23:12:30,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:30,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:30,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:30,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:30,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:31,962 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-13 23:12:31,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:31,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-13 23:12:31,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-13 23:12:31,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-13 23:12:31,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2019-01-13 23:12:31,964 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 26 states. [2019-01-13 23:12:32,765 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-01-13 23:12:32,931 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-01-13 23:12:33,252 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-01-13 23:12:33,834 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-01-13 23:12:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:34,965 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-13 23:12:34,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-13 23:12:34,967 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2019-01-13 23:12:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:34,968 INFO L225 Difference]: With dead ends: 102 [2019-01-13 23:12:34,968 INFO L226 Difference]: Without dead ends: 102 [2019-01-13 23:12:34,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=258, Invalid=2094, Unknown=0, NotChecked=0, Total=2352 [2019-01-13 23:12:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-13 23:12:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-01-13 23:12:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-13 23:12:34,976 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 44 [2019-01-13 23:12:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:34,976 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-13 23:12:34,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-13 23:12:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-13 23:12:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:12:34,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:34,980 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-13 23:12:34,981 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:34,981 INFO L82 PathProgramCache]: Analyzing trace with hash -656922246, now seen corresponding path program 1 times [2019-01-13 23:12:34,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:34,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:34,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:34,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:34,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:35,987 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-13 23:12:35,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:35,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-13 23:12:35,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 23:12:35,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 23:12:35,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-01-13 23:12:35,989 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 22 states. [2019-01-13 23:12:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:37,523 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-01-13 23:12:37,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-13 23:12:37,525 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-13 23:12:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:37,526 INFO L225 Difference]: With dead ends: 101 [2019-01-13 23:12:37,526 INFO L226 Difference]: Without dead ends: 101 [2019-01-13 23:12:37,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 23:12:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-13 23:12:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-13 23:12:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-01-13 23:12:37,531 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 45 [2019-01-13 23:12:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:37,531 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-01-13 23:12:37,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 23:12:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-01-13 23:12:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:12:37,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:37,532 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-13 23:12:37,533 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:37,533 INFO L82 PathProgramCache]: Analyzing trace with hash -656922245, now seen corresponding path program 1 times [2019-01-13 23:12:37,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:37,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:37,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:37,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:37,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:37,757 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-13 23:12:38,133 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-01-13 23:12:38,454 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-01-13 23:12:39,068 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-13 23:12:39,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:39,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-01-13 23:12:39,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-13 23:12:39,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-13 23:12:39,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-01-13 23:12:39,069 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 24 states. [2019-01-13 23:12:41,083 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-01-13 23:12:41,286 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-01-13 23:12:41,574 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-01-13 23:12:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:42,677 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-01-13 23:12:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-13 23:12:42,679 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-01-13 23:12:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:42,680 INFO L225 Difference]: With dead ends: 100 [2019-01-13 23:12:42,680 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 23:12:42,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070 [2019-01-13 23:12:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 23:12:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-13 23:12:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-01-13 23:12:42,684 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 45 [2019-01-13 23:12:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:42,685 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-01-13 23:12:42,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-13 23:12:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-01-13 23:12:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-13 23:12:42,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:42,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, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:12:42,689 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:42,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1976398196, now seen corresponding path program 1 times [2019-01-13 23:12:42,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:42,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:43,419 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-13 23:12:43,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:43,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 23:12:43,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 23:12:43,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 23:12:43,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-13 23:12:43,421 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 17 states. [2019-01-13 23:12:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:44,028 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-01-13 23:12:44,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 23:12:44,031 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2019-01-13 23:12:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:44,032 INFO L225 Difference]: With dead ends: 100 [2019-01-13 23:12:44,032 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 23:12:44,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-01-13 23:12:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 23:12:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-13 23:12:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-13 23:12:44,036 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 51 [2019-01-13 23:12:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:44,037 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-13 23:12:44,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 23:12:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-13 23:12:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 23:12:44,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:44,038 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-13 23:12:44,038 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:44,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1138801544, now seen corresponding path program 1 times [2019-01-13 23:12:44,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:44,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:44,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:44,960 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-13 23:12:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:44,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:12:44,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:12:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:12:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:12:44,961 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 12 states. [2019-01-13 23:12:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:45,980 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-13 23:12:45,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 23:12:45,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-01-13 23:12:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:45,982 INFO L225 Difference]: With dead ends: 100 [2019-01-13 23:12:45,983 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 23:12:45,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-01-13 23:12:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 23:12:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-13 23:12:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-13 23:12:45,988 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 52 [2019-01-13 23:12:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:45,988 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-13 23:12:45,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:12:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-13 23:12:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 23:12:45,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:45,991 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-13 23:12:45,991 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash -89738863, now seen corresponding path program 1 times [2019-01-13 23:12:45,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:45,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:45,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:45,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:45,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:46,202 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-13 23:12:46,964 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-13 23:12:46,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:46,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-01-13 23:12:46,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-13 23:12:46,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-13 23:12:46,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2019-01-13 23:12:46,967 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 30 states. [2019-01-13 23:12:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:49,758 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-13 23:12:49,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-13 23:12:49,760 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-01-13 23:12:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:49,761 INFO L225 Difference]: With dead ends: 103 [2019-01-13 23:12:49,761 INFO L226 Difference]: Without dead ends: 103 [2019-01-13 23:12:49,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=237, Invalid=2415, Unknown=0, NotChecked=0, Total=2652 [2019-01-13 23:12:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-13 23:12:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-13 23:12:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-13 23:12:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-01-13 23:12:49,766 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 55 [2019-01-13 23:12:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:49,766 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-01-13 23:12:49,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-13 23:12:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-01-13 23:12:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 23:12:49,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:49,770 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-13 23:12:49,771 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:49,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash -89738862, now seen corresponding path program 1 times [2019-01-13 23:12:49,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:49,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:49,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:50,872 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-13 23:12:50,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:50,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-13 23:12:50,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-13 23:12:50,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-13 23:12:50,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2019-01-13 23:12:50,874 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 28 states. [2019-01-13 23:12:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:52,789 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-13 23:12:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-13 23:12:52,790 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2019-01-13 23:12:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:52,792 INFO L225 Difference]: With dead ends: 103 [2019-01-13 23:12:52,792 INFO L226 Difference]: Without dead ends: 103 [2019-01-13 23:12:52,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2019-01-13 23:12:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-13 23:12:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-13 23:12:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-13 23:12:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-13 23:12:52,796 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 55 [2019-01-13 23:12:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:52,796 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-13 23:12:52,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-13 23:12:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-13 23:12:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 23:12:52,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:52,797 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-13 23:12:52,798 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash -781807650, now seen corresponding path program 1 times [2019-01-13 23:12:52,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:52,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:52,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:53,138 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-13 23:12:53,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:53,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:12:53,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:12:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:12:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:12:53,143 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 6 states. [2019-01-13 23:12:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:53,471 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-13 23:12:53,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:12:53,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-13 23:12:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:53,473 INFO L225 Difference]: With dead ends: 100 [2019-01-13 23:12:53,474 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 23:12:53,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:12:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 23:12:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-13 23:12:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:12:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-13 23:12:53,479 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 60 [2019-01-13 23:12:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:53,479 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-13 23:12:53,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:12:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-13 23:12:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 23:12:53,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:53,480 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-13 23:12:53,482 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash -781807649, now seen corresponding path program 1 times [2019-01-13 23:12:53,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:53,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:54,086 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-13 23:12:54,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:12:54,087 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-13 23:12:54,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:54,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:12:55,060 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-13 23:12:55,075 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-13 23:12:55,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:12:55,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:12:55,086 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-13 23:12:55,089 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-13 23:12:55,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:12:55,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:12:55,128 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-13 23:12:55,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:7 [2019-01-13 23:12:55,393 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-13 23:12:55,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:12:55,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2019-01-13 23:12:55,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 23:12:55,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 23:12:55,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-13 23:12:55,421 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 20 states. [2019-01-13 23:12:56,445 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-13 23:12:57,142 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-13 23:12:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:57,520 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-01-13 23:12:57,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 23:12:57,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-01-13 23:12:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:57,523 INFO L225 Difference]: With dead ends: 118 [2019-01-13 23:12:57,523 INFO L226 Difference]: Without dead ends: 118 [2019-01-13 23:12:57,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2019-01-13 23:12:57,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-13 23:12:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2019-01-13 23:12:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-13 23:12:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-01-13 23:12:57,529 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 60 [2019-01-13 23:12:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:57,529 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-01-13 23:12:57,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 23:12:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-01-13 23:12:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 23:12:57,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:57,533 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-13 23:12:57,534 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:57,534 INFO L82 PathProgramCache]: Analyzing trace with hash 177816052, now seen corresponding path program 1 times [2019-01-13 23:12:57,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:57,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:57,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:58,064 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-13 23:12:58,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:58,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:12:58,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:12:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:12:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:12:58,070 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 7 states. [2019-01-13 23:12:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:59,048 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-01-13 23:12:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:12:59,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-01-13 23:12:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:59,052 INFO L225 Difference]: With dead ends: 109 [2019-01-13 23:12:59,052 INFO L226 Difference]: Without dead ends: 109 [2019-01-13 23:12:59,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:12:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-13 23:12:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-13 23:12:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-13 23:12:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-01-13 23:12:59,057 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 62 [2019-01-13 23:12:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:59,057 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-01-13 23:12:59,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:12:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-01-13 23:12:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 23:12:59,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:12:59,058 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-13 23:12:59,059 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:12:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:12:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 177816053, now seen corresponding path program 1 times [2019-01-13 23:12:59,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:12:59,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:12:59,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:59,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:12:59,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:12:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:12:59,438 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-13 23:12:59,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:12:59,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-13 23:12:59,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 23:12:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 23:12:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-13 23:12:59,441 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 14 states. [2019-01-13 23:12:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:12:59,985 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-13 23:12:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 23:12:59,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-01-13 23:12:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:12:59,989 INFO L225 Difference]: With dead ends: 108 [2019-01-13 23:12:59,989 INFO L226 Difference]: Without dead ends: 108 [2019-01-13 23:12:59,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-01-13 23:12:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-13 23:12:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-13 23:12:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 23:12:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-13 23:12:59,996 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 62 [2019-01-13 23:12:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:12:59,996 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-13 23:12:59,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 23:12:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-13 23:12:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 23:13:00,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:13:00,000 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-13 23:13:00,001 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:13:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:13:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1706349226, now seen corresponding path program 1 times [2019-01-13 23:13:00,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:13:00,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:13:00,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:13:00,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:13:00,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:13:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:13:01,009 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-13 23:13:01,702 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-13 23:13:01,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:13:01,702 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-13 23:13:01,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:13:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:13:01,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:13:01,824 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-13 23:13:01,839 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-13 23:13:01,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:01,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:13:01,860 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-13 23:13:01,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:24 [2019-01-13 23:13:01,909 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-13 23:13:01,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:01,925 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-13 23:13:01,928 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-13 23:13:01,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:01,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:13:01,940 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-13 23:13:01,940 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:18 [2019-01-13 23:13:03,551 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 23:13:04,106 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-13 23:13:04,550 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-13 23:13:04,571 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-13 23:13:04,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:04,597 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-13 23:13:04,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:15 [2019-01-13 23:13:04,872 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-13 23:13:04,877 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-13 23:13:04,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:04,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:13:04,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:13:04,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-01-13 23:13:05,044 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-13 23:13:05,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:13:05,073 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-13 23:13:05,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:05,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:13:05,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:13:05,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-13 23:13:05,251 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-13 23:13:05,258 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-13 23:13:05,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:05,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:13:05,313 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-13 23:13:05,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 23:13:05,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:13:05,379 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-13 23:13:05,379 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:68 [2019-01-13 23:13:07,116 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-13 23:13:07,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:13:07,190 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-13 23:13:07,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:07,214 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-13 23:13:07,219 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-13 23:13:07,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:07,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:13:07,239 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-13 23:13:07,239 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:39 [2019-01-13 23:13:07,512 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-13 23:13:07,573 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-13 23:13:07,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 23:13:07,617 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-13 23:13:07,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:07,621 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-13 23:13:07,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:07,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:13:07,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:13:07,739 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-13 23:13:07,741 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2019-01-13 23:13:07,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 23:13:07,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 23:13:07,897 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:55, output treesize:89 [2019-01-13 23:13:08,417 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-13 23:13:09,264 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-13 23:13:09,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:09,266 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-13 23:13:09,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:09,269 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-13 23:13:09,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:5 [2019-01-13 23:13:09,352 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-13 23:13:09,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:13:09,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 61 [2019-01-13 23:13:09,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-13 23:13:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-13 23:13:09,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3471, Unknown=0, NotChecked=0, Total=3660 [2019-01-13 23:13:09,375 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 61 states. [2019-01-13 23:13:11,849 WARN L181 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-13 23:13:13,542 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-13 23:13:14,702 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-13 23:13:15,966 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-01-13 23:13:16,878 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-13 23:13:17,641 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-01-13 23:13:18,731 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-13 23:13:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:13:19,821 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2019-01-13 23:13:19,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-13 23:13:19,823 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 64 [2019-01-13 23:13:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:13:19,824 INFO L225 Difference]: With dead ends: 70 [2019-01-13 23:13:19,825 INFO L226 Difference]: Without dead ends: 70 [2019-01-13 23:13:19,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=682, Invalid=8248, Unknown=0, NotChecked=0, Total=8930 [2019-01-13 23:13:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-13 23:13:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-13 23:13:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-13 23:13:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 69 transitions. [2019-01-13 23:13:19,830 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 69 transitions. Word has length 64 [2019-01-13 23:13:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:13:19,830 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 69 transitions. [2019-01-13 23:13:19,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-13 23:13:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2019-01-13 23:13:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-13 23:13:19,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:13:19,831 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-13 23:13:19,832 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:13:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:13:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1217330354, now seen corresponding path program 1 times [2019-01-13 23:13:19,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:13:19,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:13:19,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:13:19,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:13:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:13:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:13:20,168 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-13 23:13:20,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:13:20,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-13 23:13:20,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 23:13:20,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 23:13:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-01-13 23:13:20,170 INFO L87 Difference]: Start difference. First operand 70 states and 69 transitions. Second operand 15 states. [2019-01-13 23:13:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:13:20,703 INFO L93 Difference]: Finished difference Result 69 states and 68 transitions. [2019-01-13 23:13:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 23:13:20,706 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-01-13 23:13:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:13:20,707 INFO L225 Difference]: With dead ends: 69 [2019-01-13 23:13:20,707 INFO L226 Difference]: Without dead ends: 69 [2019-01-13 23:13:20,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-01-13 23:13:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-13 23:13:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-13 23:13:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 23:13:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions. [2019-01-13 23:13:20,710 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 63 [2019-01-13 23:13:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:13:20,710 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 68 transitions. [2019-01-13 23:13:20,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 23:13:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2019-01-13 23:13:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 23:13:20,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:13:20,711 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-13 23:13:20,712 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_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_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-13 23:13:20,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:13:20,712 INFO L82 PathProgramCache]: Analyzing trace with hash 376565514, now seen corresponding path program 1 times [2019-01-13 23:13:20,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:13:20,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:13:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:13:20,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:13:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:13:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:13:21,018 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-13 23:13:21,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:13:21,018 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-13 23:13:21,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:13:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:13:21,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:13:21,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:13:21,434 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-13 23:13:21,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:21,439 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-13 23:13:21,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-01-13 23:13:21,620 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-13 23:13:21,622 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-13 23:13:21,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:21,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:13:21,630 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-13 23:13:21,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-01-13 23:13:21,798 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-13 23:13:21,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:21,810 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-13 23:13:21,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:10 [2019-01-13 23:13:21,920 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-13 23:13:21,924 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-13 23:13:21,925 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-13 23:13:21,928 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-13 23:13:21,934 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-13 23:13:21,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2019-01-13 23:13:23,160 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-13 23:13:23,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:13:23,183 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-13 23:13:23,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-01-13 23:13:25,747 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-13 23:13:25,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:13:25,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2019-01-13 23:13:25,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-13 23:13:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-13 23:13:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=993, Unknown=12, NotChecked=0, Total=1122 [2019-01-13 23:13:25,766 INFO L87 Difference]: Start difference. First operand 69 states and 68 transitions. Second operand 34 states. [2019-01-13 23:13:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:13:27,393 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2019-01-13 23:13:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-13 23:13:27,395 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-01-13 23:13:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:13:27,396 INFO L225 Difference]: With dead ends: 68 [2019-01-13 23:13:27,396 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 23:13:27,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=278, Invalid=2160, Unknown=12, NotChecked=0, Total=2450 [2019-01-13 23:13:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 23:13:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 23:13:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 23:13:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 23:13:27,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2019-01-13 23:13:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:13:27,398 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 23:13:27,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-13 23:13:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 23:13:27,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 23:13:27,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:13:27 BoogieIcfgContainer [2019-01-13 23:13:27,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:13:27,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:13:27,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:13:27,408 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:13:27,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:12:09" (3/4) ... [2019-01-13 23:13:27,416 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 23:13:27,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-01-13 23:13:27,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_13 [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-01-13 23:13:27,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_13 [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-01-13 23:13:27,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-01-13 23:13:27,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-01-13 23:13:27,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-01-13 23:13:27,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 23:13:27,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-01-13 23:13:27,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-01-13 23:13:27,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-01-13 23:13:27,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-01-13 23:13:27,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-01-13 23:13:27,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-01-13 23:13:27,438 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2019-01-13 23:13:27,438 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-13 23:13:27,439 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-13 23:13:27,439 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 23:13:27,440 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 23:13:27,513 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 23:13:27,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:13:27,514 INFO L168 Benchmark]: Toolchain (without parser) took 81274.58 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 557.8 MB). Free memory was 948.7 MB in the beginning and 1.5 GB in the end (delta: -562.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:13:27,515 INFO L168 Benchmark]: CDTParser took 0.20 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-13 23:13:27,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 918.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-01-13 23:13:27,515 INFO L168 Benchmark]: Boogie Preprocessor took 143.94 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-13 23:13:27,516 INFO L168 Benchmark]: RCFGBuilder took 2030.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 11.5 GB. [2019-01-13 23:13:27,516 INFO L168 Benchmark]: TraceAbstraction took 78067.92 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 422.6 MB). Free memory was 992.5 MB in the beginning and 1.5 GB in the end (delta: -518.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:13:27,516 INFO L168 Benchmark]: Witness Printer took 105.84 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 67.1 kB). Peak memory consumption was 67.1 kB. Max. memory is 11.5 GB. [2019-01-13 23:13:27,518 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.20 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 918.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 143.94 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 2030.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78067.92 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 422.6 MB). Free memory was 992.5 MB in the beginning and 1.5 GB in the end (delta: -518.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 105.84 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 67.1 kB). Peak memory consumption was 67.1 kB. 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: 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: 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: 1116]: 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: 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: 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: 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: 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: 1164]: 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: 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: 1163]: 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: 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: 1107]: 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: 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: 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: 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: 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: 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: 1451]: 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: 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, 346 locations, 80 error locations. SAFE Result, 77.9s OverallTime, 35 OverallIterations, 2 TraceHistogramMax, 45.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2191 SDtfs, 2828 SDslu, 11085 SDs, 0 SdLazy, 18171 SolverSat, 1103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1069 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 775 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5336 ImplicationChecksByTransitivity, 47.4s 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, 31.1s InterpolantComputationTime, 1528 NumberOfCodeBlocks, 1528 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1490 ConstructedInterpolants, 29 QuantifiedInterpolants, 758141 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...