./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test19_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa 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_test19_false-valid-free.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 927b64548732fdfa523149393b95aeee194275ea ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 18:16:35,986 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 18:16:35,987 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 18:16:35,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 18:16:35,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 18:16:36,001 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 18:16:36,002 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 18:16:36,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 18:16:36,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 18:16:36,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 18:16:36,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 18:16:36,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 18:16:36,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 18:16:36,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 18:16:36,010 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 18:16:36,011 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 18:16:36,012 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 18:16:36,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 18:16:36,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 18:16:36,018 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 18:16:36,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 18:16:36,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 18:16:36,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 18:16:36,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 18:16:36,025 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 18:16:36,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 18:16:36,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 18:16:36,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 18:16:36,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 18:16:36,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 18:16:36,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 18:16:36,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 18:16:36,032 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 18:16:36,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 18:16:36,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 18:16:36,034 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 18:16:36,034 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 18:16:36,050 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 18:16:36,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 18:16:36,052 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 18:16:36,052 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 18:16:36,052 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 18:16:36,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 18:16:36,052 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 18:16:36,052 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 18:16:36,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 18:16:36,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 18:16:36,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 18:16:36,054 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 18:16:36,054 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 18:16:36,054 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 18:16:36,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 18:16:36,054 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 18:16:36,055 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 18:16:36,055 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 18:16:36,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 18:16:36,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 18:16:36,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 18:16:36,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 18:16:36,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 18:16:36,057 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 18:16:36,058 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 18:16:36,058 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 18:16:36,058 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 -> 927b64548732fdfa523149393b95aeee194275ea [2019-01-01 18:16:36,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 18:16:36,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 18:16:36,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 18:16:36,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 18:16:36,112 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 18:16:36,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2019-01-01 18:16:36,171 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a874013/e99e2523720542faaa9112bd8ab2f349/FLAGac2d7c2ca [2019-01-01 18:16:36,730 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 18:16:36,730 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2019-01-01 18:16:36,756 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a874013/e99e2523720542faaa9112bd8ab2f349/FLAGac2d7c2ca [2019-01-01 18:16:36,951 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a874013/e99e2523720542faaa9112bd8ab2f349 [2019-01-01 18:16:36,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 18:16:36,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 18:16:36,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 18:16:36,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 18:16:36,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 18:16:36,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:16:36" (1/1) ... [2019-01-01 18:16:36,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c30680f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:36, skipping insertion in model container [2019-01-01 18:16:36,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:16:36" (1/1) ... [2019-01-01 18:16:36,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 18:16:37,058 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 18:16:37,587 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:16:37,611 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 18:16:37,778 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:16:37,878 INFO L195 MainTranslator]: Completed translation [2019-01-01 18:16:37,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37 WrapperNode [2019-01-01 18:16:37,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 18:16:37,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 18:16:37,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 18:16:37,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 18:16:37,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (1/1) ... [2019-01-01 18:16:37,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (1/1) ... [2019-01-01 18:16:37,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (1/1) ... [2019-01-01 18:16:37,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (1/1) ... [2019-01-01 18:16:37,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (1/1) ... [2019-01-01 18:16:37,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (1/1) ... [2019-01-01 18:16:38,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (1/1) ... [2019-01-01 18:16:38,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 18:16:38,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 18:16:38,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 18:16:38,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 18:16:38,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (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-01 18:16:38,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 18:16:38,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 18:16:38,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-01 18:16:38,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 18:16:38,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 18:16:38,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-01 18:16:38,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-01 18:16:38,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-01 18:16:38,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-01 18:16:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-01 18:16:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-01 18:16:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-01 18:16:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-01 18:16:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-01 18:16:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-01 18:16:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-01 18:16:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-01 18:16:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-01 18:16:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-01 18:16:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-01 18:16:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-01 18:16:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-01 18:16:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-01 18:16:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-01 18:16:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-01 18:16:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-01 18:16:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-01 18:16:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-01 18:16:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-01 18:16:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-01 18:16:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-01 18:16:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-01 18:16:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-01 18:16:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-01 18:16:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-01 18:16:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-01 18:16:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 18:16:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 18:16:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2019-01-01 18:16:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2019-01-01 18:16:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2019-01-01 18:16:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2019-01-01 18:16:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2019-01-01 18:16:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-01 18:16:38,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 18:16:38,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-01 18:16:38,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-01 18:16:38,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-01 18:16:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 18:16:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 18:16:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 18:16:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 18:16:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 18:16:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 18:16:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 18:16:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 18:16:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 18:16:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 18:16:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 18:16:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 18:16:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 18:16:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 18:16:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 18:16:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 18:16:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 18:16:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 18:16:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 18:16:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 18:16:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 18:16:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 18:16:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 18:16:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 18:16:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 18:16:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 18:16:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 18:16:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 18:16:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 18:16:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 18:16:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 18:16:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 18:16:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 18:16:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 18:16:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 18:16:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 18:16:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 18:16:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 18:16:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 18:16:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 18:16:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 18:16:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 18:16:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 18:16:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 18:16:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 18:16:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 18:16:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 18:16:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 18:16:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 18:16:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 18:16:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 18:16:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 18:16:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 18:16:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 18:16:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 18:16:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 18:16:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 18:16:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 18:16:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 18:16:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 18:16:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 18:16:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 18:16:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 18:16:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 18:16:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 18:16:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 18:16:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 18:16:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 18:16:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 18:16:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 18:16:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 18:16:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 18:16:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 18:16:38,132 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 18:16:38,132 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 18:16:38,132 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 18:16:38,132 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 18:16:38,132 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 18:16:38,132 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 18:16:38,132 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 18:16:38,132 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 18:16:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 18:16:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 18:16:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 18:16:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-01 18:16:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-01 18:16:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 18:16:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-01 18:16:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-01 18:16:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-01 18:16:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 18:16:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-01 18:16:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-01 18:16:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-01 18:16:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 18:16:38,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-01 18:16:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-01 18:16:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-01 18:16:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-01 18:16:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-01 18:16:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-01 18:16:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 18:16:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-01 18:16:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-01 18:16:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-01 18:16:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-01 18:16:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-01 18:16:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 18:16:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 18:16:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-01 18:16:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-01 18:16:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-01 18:16:38,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-01 18:16:38,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-01 18:16:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-01 18:16:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-01 18:16:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-01 18:16:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-01 18:16:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-01 18:16:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-01 18:16:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-01 18:16:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-01 18:16:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-01 18:16:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-01 18:16:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 18:16:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 18:16:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2019-01-01 18:16:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2019-01-01 18:16:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2019-01-01 18:16:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2019-01-01 18:16:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2019-01-01 18:16:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-01 18:16:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 18:16:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 18:16:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 18:16:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 18:16:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 18:16:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-01 18:16:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-01 18:16:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-01 18:16:38,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-01 18:16:39,045 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-01 18:16:40,196 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-01 18:16:40,611 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 18:16:40,611 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 18:16:40,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:16:40 BoogieIcfgContainer [2019-01-01 18:16:40,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 18:16:40,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 18:16:40,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 18:16:40,618 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 18:16:40,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 06:16:36" (1/3) ... [2019-01-01 18:16:40,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc5e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:16:40, skipping insertion in model container [2019-01-01 18:16:40,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:16:37" (2/3) ... [2019-01-01 18:16:40,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc5e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:16:40, skipping insertion in model container [2019-01-01 18:16:40,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:16:40" (3/3) ... [2019-01-01 18:16:40,623 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2019-01-01 18:16:40,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 18:16:40,643 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 94 error locations. [2019-01-01 18:16:40,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2019-01-01 18:16:40,688 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 18:16:40,689 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 18:16:40,689 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 18:16:40,689 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 18:16:40,689 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 18:16:40,689 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 18:16:40,690 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 18:16:40,690 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 18:16:40,690 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 18:16:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-01-01 18:16:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 18:16:40,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:40,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:16:40,725 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:40,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash -223042541, now seen corresponding path program 1 times [2019-01-01 18:16:40,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:40,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:40,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:40,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:41,636 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-01 18:16:41,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:41,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:16:41,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:16:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:16:41,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:16:41,661 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 8 states. [2019-01-01 18:16:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:43,301 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2019-01-01 18:16:43,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:16:43,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 18:16:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:43,318 INFO L225 Difference]: With dead ends: 157 [2019-01-01 18:16:43,318 INFO L226 Difference]: Without dead ends: 154 [2019-01-01 18:16:43,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:16:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-01 18:16:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 88. [2019-01-01 18:16:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-01 18:16:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2019-01-01 18:16:43,375 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 15 [2019-01-01 18:16:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:43,375 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-01-01 18:16:43,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:16:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2019-01-01 18:16:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 18:16:43,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:43,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:16:43,379 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:43,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:43,379 INFO L82 PathProgramCache]: Analyzing trace with hash -223042540, now seen corresponding path program 1 times [2019-01-01 18:16:43,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:43,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:43,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:43,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:43,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:43,581 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-01 18:16:43,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:43,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:16:43,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:16:43,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:16:43,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:16:43,585 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 8 states. [2019-01-01 18:16:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:44,154 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2019-01-01 18:16:44,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:16:44,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 18:16:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:44,159 INFO L225 Difference]: With dead ends: 138 [2019-01-01 18:16:44,159 INFO L226 Difference]: Without dead ends: 138 [2019-01-01 18:16:44,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:16:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-01 18:16:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2019-01-01 18:16:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-01 18:16:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-01-01 18:16:44,175 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 15 [2019-01-01 18:16:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:44,176 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-01-01 18:16:44,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:16:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-01-01 18:16:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 18:16:44,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:44,177 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] [2019-01-01 18:16:44,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:44,179 INFO L82 PathProgramCache]: Analyzing trace with hash -944686895, now seen corresponding path program 1 times [2019-01-01 18:16:44,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:44,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:44,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:44,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:44,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:44,544 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-01 18:16:44,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:44,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 18:16:44,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 18:16:44,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 18:16:44,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:16:44,546 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 11 states. [2019-01-01 18:16:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:45,677 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2019-01-01 18:16:45,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 18:16:45,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-01 18:16:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:45,683 INFO L225 Difference]: With dead ends: 132 [2019-01-01 18:16:45,683 INFO L226 Difference]: Without dead ends: 132 [2019-01-01 18:16:45,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-01-01 18:16:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-01 18:16:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2019-01-01 18:16:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-01 18:16:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-01-01 18:16:45,694 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 26 [2019-01-01 18:16:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:45,695 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-01-01 18:16:45,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 18:16:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-01-01 18:16:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 18:16:45,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:45,696 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] [2019-01-01 18:16:45,697 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:45,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:45,697 INFO L82 PathProgramCache]: Analyzing trace with hash -944686894, now seen corresponding path program 1 times [2019-01-01 18:16:45,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:45,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:45,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:16:45,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:45,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 18:16:45,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 18:16:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 18:16:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:16:45,930 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 10 states. [2019-01-01 18:16:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:46,743 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2019-01-01 18:16:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 18:16:46,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-01 18:16:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:46,746 INFO L225 Difference]: With dead ends: 130 [2019-01-01 18:16:46,747 INFO L226 Difference]: Without dead ends: 130 [2019-01-01 18:16:46,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:16:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-01 18:16:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2019-01-01 18:16:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-01 18:16:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-01-01 18:16:46,756 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 26 [2019-01-01 18:16:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:46,756 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-01-01 18:16:46,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 18:16:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-01-01 18:16:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 18:16:46,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:46,760 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-01 18:16:46,761 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:46,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1373248219, now seen corresponding path program 1 times [2019-01-01 18:16:46,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:46,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:46,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:46,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:46,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:46,941 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-01 18:16:46,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:46,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 18:16:46,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:16:46,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:16:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:16:46,943 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2019-01-01 18:16:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:47,041 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-01-01 18:16:47,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:16:47,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-01 18:16:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:47,044 INFO L225 Difference]: With dead ends: 88 [2019-01-01 18:16:47,044 INFO L226 Difference]: Without dead ends: 88 [2019-01-01 18:16:47,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:16:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-01 18:16:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-01-01 18:16:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-01 18:16:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-01-01 18:16:47,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 26 [2019-01-01 18:16:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:47,053 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-01-01 18:16:47,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:16:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-01-01 18:16:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 18:16:47,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:47,054 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-01 18:16:47,055 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:47,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash 134303590, now seen corresponding path program 1 times [2019-01-01 18:16:47,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:47,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:47,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:47,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:47,178 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-01 18:16:47,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:47,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 18:16:47,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:16:47,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:16:47,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:16:47,179 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2019-01-01 18:16:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:47,213 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-01-01 18:16:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 18:16:47,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-01 18:16:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:47,215 INFO L225 Difference]: With dead ends: 95 [2019-01-01 18:16:47,215 INFO L226 Difference]: Without dead ends: 95 [2019-01-01 18:16:47,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 18:16:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-01 18:16:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-01 18:16:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 18:16:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2019-01-01 18:16:47,225 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 26 [2019-01-01 18:16:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:47,226 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2019-01-01 18:16:47,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:16:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2019-01-01 18:16:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 18:16:47,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:47,227 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] [2019-01-01 18:16:47,229 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash -130930805, now seen corresponding path program 1 times [2019-01-01 18:16:47,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:47,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:47,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:47,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:47,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:47,405 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-01 18:16:47,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:47,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 18:16:47,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 18:16:47,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 18:16:47,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 18:16:47,406 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 4 states. [2019-01-01 18:16:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:47,570 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2019-01-01 18:16:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 18:16:47,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-01-01 18:16:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:47,574 INFO L225 Difference]: With dead ends: 121 [2019-01-01 18:16:47,574 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 18:16:47,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 18:16:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 18:16:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2019-01-01 18:16:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 18:16:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-01-01 18:16:47,584 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 27 [2019-01-01 18:16:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:47,585 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-01-01 18:16:47,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 18:16:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-01-01 18:16:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 18:16:47,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:47,587 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] [2019-01-01 18:16:47,589 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:47,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1697908740, now seen corresponding path program 1 times [2019-01-01 18:16:47,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:47,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:47,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:47,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:47,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:16:47,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:47,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:16:47,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:16:47,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:16:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:16:47,781 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 5 states. [2019-01-01 18:16:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:47,841 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2019-01-01 18:16:47,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:16:47,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-01 18:16:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:47,845 INFO L225 Difference]: With dead ends: 120 [2019-01-01 18:16:47,845 INFO L226 Difference]: Without dead ends: 120 [2019-01-01 18:16:47,847 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-01 18:16:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-01 18:16:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-01-01 18:16:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 18:16:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2019-01-01 18:16:47,863 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 35 [2019-01-01 18:16:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:47,863 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2019-01-01 18:16:47,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:16:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2019-01-01 18:16:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 18:16:47,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:47,866 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] [2019-01-01 18:16:47,867 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash -810405059, now seen corresponding path program 1 times [2019-01-01 18:16:47,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:47,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:47,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:47,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:47,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:16:48,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:16:48,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 18:16:48,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:16:48,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:16:48,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:16:48,138 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 6 states. [2019-01-01 18:16:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:48,320 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-01-01 18:16:48,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:16:48,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-01-01 18:16:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:48,323 INFO L225 Difference]: With dead ends: 109 [2019-01-01 18:16:48,323 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 18:16:48,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:16:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 18:16:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-01 18:16:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 18:16:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2019-01-01 18:16:48,333 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 35 [2019-01-01 18:16:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:48,333 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2019-01-01 18:16:48,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:16:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2019-01-01 18:16:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 18:16:48,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:48,337 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:16:48,339 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1103808066, now seen corresponding path program 1 times [2019-01-01 18:16:48,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:48,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:48,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:16:48,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:16:48,917 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-01 18:16:48,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:48,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:16:49,177 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 13 treesize of output 10 [2019-01-01 18:16:49,180 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 10 treesize of output 9 [2019-01-01 18:16:49,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:49,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:49,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:49,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-01 18:16:50,098 WARN L860 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2019-01-01 18:16:50,138 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-01 18:16:50,143 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 16 treesize of output 17 [2019-01-01 18:16:50,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:50,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:50,157 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-01 18:16:50,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-01-01 18:16:50,178 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 19 treesize of output 15 [2019-01-01 18:16:50,183 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 15 treesize of output 3 [2019-01-01 18:16:50,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:50,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:50,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:50,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-01-01 18:16:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:16:50,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:16:50,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 17 [2019-01-01 18:16:50,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 18:16:50,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 18:16:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=227, Unknown=1, NotChecked=30, Total=306 [2019-01-01 18:16:50,228 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 18 states. [2019-01-01 18:16:52,649 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 18:16:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:53,156 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2019-01-01 18:16:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 18:16:53,158 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-01 18:16:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:53,160 INFO L225 Difference]: With dead ends: 108 [2019-01-01 18:16:53,160 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 18:16:53,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=4, NotChecked=50, Total=756 [2019-01-01 18:16:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 18:16:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-01 18:16:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 18:16:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-01-01 18:16:53,169 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 35 [2019-01-01 18:16:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:53,170 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-01-01 18:16:53,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 18:16:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-01-01 18:16:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 18:16:53,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:53,174 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:16:53,175 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash 141688527, now seen corresponding path program 1 times [2019-01-01 18:16:53,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:53,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:53,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:53,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:53,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:53,858 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-01 18:16:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:16:54,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:16:54,093 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-01 18:16:54,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:54,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:16:54,198 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 13 treesize of output 10 [2019-01-01 18:16:54,201 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 10 treesize of output 9 [2019-01-01 18:16:54,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-01 18:16:54,225 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 11 treesize of output 9 [2019-01-01 18:16:54,227 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 9 treesize of output 5 [2019-01-01 18:16:54,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-01-01 18:16:54,808 WARN L860 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret38.base|))) (<= f19_~a.offset |c_f19_#in~a.offset|))) is different from true [2019-01-01 18:16:54,828 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 23 treesize of output 18 [2019-01-01 18:16:54,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:16:54,833 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 18 treesize of output 25 [2019-01-01 18:16:54,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-01-01 18:16:54,851 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 21 treesize of output 17 [2019-01-01 18:16:54,872 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 17 treesize of output 9 [2019-01-01 18:16:54,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:54,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-01 18:16:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:16:54,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:16:54,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2019-01-01 18:16:54,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 18:16:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 18:16:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2019-01-01 18:16:54,960 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 17 states. [2019-01-01 18:16:57,877 WARN L181 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 18:16:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:58,548 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-01-01 18:16:58,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 18:16:58,550 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-01-01 18:16:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:58,552 INFO L225 Difference]: With dead ends: 124 [2019-01-01 18:16:58,552 INFO L226 Difference]: Without dead ends: 124 [2019-01-01 18:16:58,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=4, NotChecked=52, Total=812 [2019-01-01 18:16:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-01 18:16:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2019-01-01 18:16:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-01 18:16:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2019-01-01 18:16:58,560 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 36 [2019-01-01 18:16:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:58,562 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2019-01-01 18:16:58,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 18:16:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2019-01-01 18:16:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 18:16:58,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:58,565 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] [2019-01-01 18:16:58,566 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:58,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1935520816, now seen corresponding path program 1 times [2019-01-01 18:16:58,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:58,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:16:58,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:16:58,704 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-01 18:16:58,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:58,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:16:58,857 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 13 treesize of output 10 [2019-01-01 18:16:58,860 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 10 treesize of output 9 [2019-01-01 18:16:58,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:58,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:58,871 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 13 treesize of output 10 [2019-01-01 18:16:58,889 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 10 treesize of output 9 [2019-01-01 18:16:58,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:58,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:58,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:58,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-01-01 18:16:58,929 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 19 treesize of output 15 [2019-01-01 18:16:58,946 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 15 treesize of output 3 [2019-01-01 18:16:58,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:58,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:58,964 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 19 treesize of output 15 [2019-01-01 18:16:58,970 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 15 treesize of output 3 [2019-01-01 18:16:58,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:58,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:59,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:59,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-01-01 18:16:59,014 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-01 18:16:59,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:16:59,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 18:16:59,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:16:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:16:59,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:16:59,036 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand 6 states. [2019-01-01 18:16:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:16:59,102 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2019-01-01 18:16:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:16:59,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-01 18:16:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:16:59,105 INFO L225 Difference]: With dead ends: 95 [2019-01-01 18:16:59,105 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 18:16:59,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:16:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 18:16:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-01-01 18:16:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 18:16:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-01-01 18:16:59,112 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 36 [2019-01-01 18:16:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:16:59,112 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-01-01 18:16:59,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:16:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-01-01 18:16:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 18:16:59,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:16:59,113 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:16:59,117 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:16:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:16:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash 97377248, now seen corresponding path program 1 times [2019-01-01 18:16:59,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:16:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:16:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:59,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:16:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:16:59,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:16:59,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:16:59,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:16:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:16:59,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:16:59,549 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-01 18:16:59,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:59,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:59,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:16:59,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 18:16:59,683 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 10 treesize of output 9 [2019-01-01 18:16:59,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:16:59,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:59,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:16:59,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-01 18:17:04,062 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 18:17:04,073 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 23 treesize of output 18 [2019-01-01 18:17:04,086 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2019-01-01 18:17:04,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 18:17:04,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 18:17:04,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 18:17:04,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2019-01-01 18:17:04,176 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 24 treesize of output 20 [2019-01-01 18:17:04,184 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 15 treesize of output 3 [2019-01-01 18:17:04,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:04,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:04,206 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 28 treesize of output 22 [2019-01-01 18:17:04,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2019-01-01 18:17:04,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 18:17:04,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 18:17:04,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 18:17:04,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2019-01-01 18:17:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:17:04,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:04,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-01-01 18:17:04,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 18:17:04,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 18:17:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=389, Unknown=8, NotChecked=0, Total=462 [2019-01-01 18:17:04,315 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 22 states. [2019-01-01 18:17:24,628 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 18:17:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:24,823 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2019-01-01 18:17:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 18:17:24,824 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-01-01 18:17:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:24,826 INFO L225 Difference]: With dead ends: 102 [2019-01-01 18:17:24,826 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 18:17:24,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=151, Invalid=892, Unknown=13, NotChecked=0, Total=1056 [2019-01-01 18:17:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 18:17:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2019-01-01 18:17:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 18:17:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-01-01 18:17:24,834 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 37 [2019-01-01 18:17:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:24,841 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-01-01 18:17:24,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 18:17:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-01-01 18:17:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 18:17:24,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:24,842 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] [2019-01-01 18:17:24,847 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:24,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1701994704, now seen corresponding path program 1 times [2019-01-01 18:17:24,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:24,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:24,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:24,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:24,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:17:25,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:25,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:17:25,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:17:25,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:17:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:17:25,217 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 8 states. [2019-01-01 18:17:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:25,362 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2019-01-01 18:17:25,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:17:25,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-01-01 18:17:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:25,365 INFO L225 Difference]: With dead ends: 103 [2019-01-01 18:17:25,366 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 18:17:25,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 18:17:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 18:17:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2019-01-01 18:17:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-01 18:17:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-01-01 18:17:25,374 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 42 [2019-01-01 18:17:25,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:25,374 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-01-01 18:17:25,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:17:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-01-01 18:17:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 18:17:25,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:25,377 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] [2019-01-01 18:17:25,378 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1701994705, now seen corresponding path program 1 times [2019-01-01 18:17:25,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:25,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:25,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:17:25,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:25,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 18:17:25,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 18:17:25,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 18:17:25,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:17:25,630 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 11 states. [2019-01-01 18:17:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:26,104 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-01-01 18:17:26,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 18:17:26,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-01-01 18:17:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:26,107 INFO L225 Difference]: With dead ends: 102 [2019-01-01 18:17:26,108 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 18:17:26,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:17:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 18:17:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2019-01-01 18:17:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 18:17:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-01-01 18:17:26,113 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 42 [2019-01-01 18:17:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:26,116 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-01-01 18:17:26,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 18:17:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-01-01 18:17:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 18:17:26,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:26,117 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] [2019-01-01 18:17:26,117 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:26,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1222228259, now seen corresponding path program 1 times [2019-01-01 18:17:26,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:26,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:26,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:26,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:26,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:26,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 18:17:26,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 18:17:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 18:17:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:17:26,304 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 11 states. [2019-01-01 18:17:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:26,599 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-01-01 18:17:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 18:17:26,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-01-01 18:17:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:26,601 INFO L225 Difference]: With dead ends: 101 [2019-01-01 18:17:26,601 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 18:17:26,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:17:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 18:17:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-01-01 18:17:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 18:17:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-01-01 18:17:26,605 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 43 [2019-01-01 18:17:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:26,606 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-01-01 18:17:26,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 18:17:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-01-01 18:17:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 18:17:26,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:26,606 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] [2019-01-01 18:17:26,608 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash -765629584, now seen corresponding path program 1 times [2019-01-01 18:17:26,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:26,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:26,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:26,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:26,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 18:17:26,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 18:17:26,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 18:17:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:17:26,855 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 11 states. [2019-01-01 18:17:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:27,137 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-01-01 18:17:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 18:17:27,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-01-01 18:17:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:27,140 INFO L225 Difference]: With dead ends: 124 [2019-01-01 18:17:27,140 INFO L226 Difference]: Without dead ends: 124 [2019-01-01 18:17:27,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:17:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-01 18:17:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2019-01-01 18:17:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 18:17:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-01 18:17:27,145 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 44 [2019-01-01 18:17:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:27,145 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-01 18:17:27,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 18:17:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-01-01 18:17:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 18:17:27,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:27,150 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:17:27,151 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:27,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1491281423, now seen corresponding path program 1 times [2019-01-01 18:17:27,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:27,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:27,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:27,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:27,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:27,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 18:17:27,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 18:17:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 18:17:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:17:27,524 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 12 states. [2019-01-01 18:17:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:27,979 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-01-01 18:17:27,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 18:17:27,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-01-01 18:17:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:27,980 INFO L225 Difference]: With dead ends: 123 [2019-01-01 18:17:27,980 INFO L226 Difference]: Without dead ends: 119 [2019-01-01 18:17:27,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:17:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-01 18:17:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-01-01 18:17:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 18:17:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2019-01-01 18:17:27,992 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 44 [2019-01-01 18:17:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:27,992 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2019-01-01 18:17:27,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 18:17:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2019-01-01 18:17:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 18:17:27,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:27,995 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:17:27,996 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:27,996 INFO L82 PathProgramCache]: Analyzing trace with hash 980747246, now seen corresponding path program 1 times [2019-01-01 18:17:27,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:27,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:27,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:28,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:28,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:17:28,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:28,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:17:28,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:28,252 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 5 states. [2019-01-01 18:17:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:28,535 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-01-01 18:17:28,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:28,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-01-01 18:17:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:28,538 INFO L225 Difference]: With dead ends: 109 [2019-01-01 18:17:28,538 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 18:17:28,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:17:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 18:17:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-01 18:17:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 18:17:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-01-01 18:17:28,553 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 44 [2019-01-01 18:17:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:28,553 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-01-01 18:17:28,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-01-01 18:17:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 18:17:28,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:28,554 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] [2019-01-01 18:17:28,555 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2035286725, now seen corresponding path program 1 times [2019-01-01 18:17:28,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:28,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:28,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:28,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:29,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:29,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 18:17:29,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 18:17:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 18:17:29,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:17:29,168 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 11 states. [2019-01-01 18:17:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:29,440 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2019-01-01 18:17:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 18:17:29,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-01 18:17:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:29,444 INFO L225 Difference]: With dead ends: 108 [2019-01-01 18:17:29,444 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 18:17:29,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:17:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 18:17:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-01-01 18:17:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 18:17:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-01-01 18:17:29,455 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 45 [2019-01-01 18:17:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:29,456 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-01-01 18:17:29,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 18:17:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-01-01 18:17:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 18:17:29,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:29,459 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] [2019-01-01 18:17:29,461 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash -98408491, now seen corresponding path program 1 times [2019-01-01 18:17:29,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:29,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:29,743 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-01 18:17:29,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:29,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-01 18:17:29,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 18:17:29,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 18:17:29,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:17:29,745 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 14 states. [2019-01-01 18:17:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:30,756 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2019-01-01 18:17:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 18:17:30,757 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2019-01-01 18:17:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:30,758 INFO L225 Difference]: With dead ends: 110 [2019-01-01 18:17:30,758 INFO L226 Difference]: Without dead ends: 110 [2019-01-01 18:17:30,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-01-01 18:17:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-01 18:17:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2019-01-01 18:17:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 18:17:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2019-01-01 18:17:30,770 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 46 [2019-01-01 18:17:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:30,770 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2019-01-01 18:17:30,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 18:17:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2019-01-01 18:17:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 18:17:30,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:30,774 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] [2019-01-01 18:17:30,774 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -98408492, now seen corresponding path program 1 times [2019-01-01 18:17:30,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:30,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:30,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:30,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:17:30,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:30,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 18:17:30,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 18:17:30,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 18:17:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:17:30,878 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 10 states. [2019-01-01 18:17:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:31,457 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2019-01-01 18:17:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 18:17:31,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-01-01 18:17:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:31,462 INFO L225 Difference]: With dead ends: 119 [2019-01-01 18:17:31,462 INFO L226 Difference]: Without dead ends: 119 [2019-01-01 18:17:31,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:17:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-01 18:17:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2019-01-01 18:17:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 18:17:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-01-01 18:17:31,466 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 46 [2019-01-01 18:17:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:31,467 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-01-01 18:17:31,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 18:17:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-01-01 18:17:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 18:17:31,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:31,468 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:17:31,468 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 108865954, now seen corresponding path program 1 times [2019-01-01 18:17:31,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:31,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:17:31,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:31,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 18:17:31,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:17:31,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:17:31,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:17:31,751 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 8 states. [2019-01-01 18:17:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:31,810 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-01-01 18:17:31,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:17:31,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-01-01 18:17:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:31,813 INFO L225 Difference]: With dead ends: 120 [2019-01-01 18:17:31,813 INFO L226 Difference]: Without dead ends: 120 [2019-01-01 18:17:31,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:17:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-01 18:17:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-01-01 18:17:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 18:17:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2019-01-01 18:17:31,817 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 45 [2019-01-01 18:17:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:31,818 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2019-01-01 18:17:31,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:17:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2019-01-01 18:17:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 18:17:31,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:31,819 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] [2019-01-01 18:17:31,819 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:31,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1244304078, now seen corresponding path program 1 times [2019-01-01 18:17:31,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:31,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:31,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:31,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:31,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:32,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:32,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:32,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:32,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:32,387 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 13 treesize of output 10 [2019-01-01 18:17:32,389 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 10 treesize of output 9 [2019-01-01 18:17:32,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:32,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:32,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:32,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-01-01 18:17:32,959 WARN L860 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2019-01-01 18:17:32,998 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-01 18:17:33,002 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 16 treesize of output 17 [2019-01-01 18:17:33,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:33,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:33,013 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-01 18:17:33,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-01-01 18:17:33,293 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 19 treesize of output 15 [2019-01-01 18:17:33,307 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 15 treesize of output 3 [2019-01-01 18:17:33,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:33,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:33,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:33,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-01-01 18:17:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:17:33,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:17:33,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2019-01-01 18:17:33,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 18:17:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 18:17:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=569, Unknown=1, NotChecked=48, Total=702 [2019-01-01 18:17:33,339 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 27 states. [2019-01-01 18:17:37,387 WARN L181 SmtUtils]: Spent 2.51 s on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 18:17:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:38,643 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-01-01 18:17:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 18:17:38,644 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-01-01 18:17:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:38,645 INFO L225 Difference]: With dead ends: 116 [2019-01-01 18:17:38,645 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 18:17:38,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=217, Invalid=1423, Unknown=4, NotChecked=78, Total=1722 [2019-01-01 18:17:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 18:17:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-01 18:17:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 18:17:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-01-01 18:17:38,651 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 47 [2019-01-01 18:17:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:38,651 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-01-01 18:17:38,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 18:17:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-01-01 18:17:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 18:17:38,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:38,659 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] [2019-01-01 18:17:38,660 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1173574159, now seen corresponding path program 1 times [2019-01-01 18:17:38,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:38,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:38,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:38,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:38,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 18:17:38,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 18:17:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 18:17:38,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-01-01 18:17:38,865 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 15 states. [2019-01-01 18:17:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:39,311 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2019-01-01 18:17:39,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 18:17:39,312 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-01-01 18:17:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:39,314 INFO L225 Difference]: With dead ends: 117 [2019-01-01 18:17:39,314 INFO L226 Difference]: Without dead ends: 117 [2019-01-01 18:17:39,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-01-01 18:17:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-01 18:17:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-01 18:17:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-01 18:17:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2019-01-01 18:17:39,319 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 48 [2019-01-01 18:17:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:39,319 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2019-01-01 18:17:39,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 18:17:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2019-01-01 18:17:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 18:17:39,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:39,320 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] [2019-01-01 18:17:39,321 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1244929276, now seen corresponding path program 1 times [2019-01-01 18:17:39,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:39,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:39,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:17:39,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:17:39,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:17:39,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:17:39,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:17:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:17:39,539 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 5 states. [2019-01-01 18:17:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:39,571 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-01-01 18:17:39,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:17:39,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-01 18:17:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:39,575 INFO L225 Difference]: With dead ends: 118 [2019-01-01 18:17:39,575 INFO L226 Difference]: Without dead ends: 118 [2019-01-01 18:17:39,578 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-01 18:17:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-01 18:17:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2019-01-01 18:17:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-01 18:17:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2019-01-01 18:17:39,587 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 47 [2019-01-01 18:17:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:39,587 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2019-01-01 18:17:39,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:17:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2019-01-01 18:17:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 18:17:39,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:39,588 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] [2019-01-01 18:17:39,592 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash -81279148, now seen corresponding path program 1 times [2019-01-01 18:17:39,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:39,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:39,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:39,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:39,964 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 7 [2019-01-01 18:17:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:40,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:40,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:40,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:40,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:40,358 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 13 treesize of output 10 [2019-01-01 18:17:40,362 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 10 treesize of output 9 [2019-01-01 18:17:40,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:40,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:40,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:40,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-01-01 18:17:40,379 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 11 treesize of output 9 [2019-01-01 18:17:40,381 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 9 treesize of output 5 [2019-01-01 18:17:40,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:40,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:40,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:40,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-01-01 18:17:40,984 WARN L860 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret38.base|))) (<= f19_~a.offset |c_f19_#in~a.offset|))) is different from true [2019-01-01 18:17:41,014 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 23 treesize of output 18 [2019-01-01 18:17:41,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:17:41,023 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 18 treesize of output 25 [2019-01-01 18:17:41,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:41,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:41,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:41,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-01-01 18:17:41,216 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 21 treesize of output 17 [2019-01-01 18:17:41,218 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 17 treesize of output 9 [2019-01-01 18:17:41,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:41,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:41,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:41,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-01 18:17:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:41,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:17:41,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 22 [2019-01-01 18:17:41,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 18:17:41,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 18:17:41,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=398, Unknown=1, NotChecked=40, Total=506 [2019-01-01 18:17:41,247 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 23 states. [2019-01-01 18:17:50,120 WARN L181 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 18:17:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:17:55,736 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-01-01 18:17:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 18:17:55,739 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-01 18:17:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:17:55,741 INFO L225 Difference]: With dead ends: 118 [2019-01-01 18:17:55,741 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 18:17:55,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=153, Invalid=968, Unknown=5, NotChecked=64, Total=1190 [2019-01-01 18:17:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 18:17:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-01 18:17:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 18:17:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2019-01-01 18:17:55,746 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 48 [2019-01-01 18:17:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:17:55,746 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2019-01-01 18:17:55,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 18:17:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2019-01-01 18:17:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 18:17:55,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:17:55,747 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:17:55,748 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:17:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:17:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash -919497490, now seen corresponding path program 1 times [2019-01-01 18:17:55,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:17:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:17:55,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:55,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:55,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:17:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:17:56,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:17:56,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:17:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:17:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:17:56,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:17:56,710 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-01 18:17:56,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:56,716 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-01 18:17:56,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-01 18:17:56,792 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 13 treesize of output 10 [2019-01-01 18:17:56,794 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 10 treesize of output 9 [2019-01-01 18:17:56,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:56,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:56,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:56,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:36 [2019-01-01 18:17:56,841 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 11 treesize of output 1 [2019-01-01 18:17:56,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:56,851 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 9 treesize of output 7 [2019-01-01 18:17:56,854 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 7 treesize of output 3 [2019-01-01 18:17:56,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:17:56,856 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:17:56,860 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-01 18:17:56,860 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:27, output treesize:7 [2019-01-01 18:18:02,278 WARN L181 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 18:18:02,297 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 44 treesize of output 35 [2019-01-01 18:18:02,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:18:02,302 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 35 treesize of output 46 [2019-01-01 18:18:02,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:02,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:02,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:02,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:36 [2019-01-01 18:18:02,333 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 42 treesize of output 34 [2019-01-01 18:18:02,336 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 34 treesize of output 15 [2019-01-01 18:18:02,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:02,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:02,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:02,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:15 [2019-01-01 18:18:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:18:07,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:18:07,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-01-01 18:18:07,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 18:18:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 18:18:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=645, Unknown=17, NotChecked=0, Total=756 [2019-01-01 18:18:07,840 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 28 states. [2019-01-01 18:18:17,049 WARN L181 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 18:18:19,763 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-01 18:18:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:18:29,764 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2019-01-01 18:18:29,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 18:18:29,765 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2019-01-01 18:18:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:18:29,766 INFO L225 Difference]: With dead ends: 122 [2019-01-01 18:18:29,766 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 18:18:29,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=165, Invalid=1221, Unknown=20, NotChecked=0, Total=1406 [2019-01-01 18:18:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 18:18:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-01-01 18:18:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 18:18:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2019-01-01 18:18:29,773 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 46 [2019-01-01 18:18:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:18:29,773 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2019-01-01 18:18:29,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 18:18:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2019-01-01 18:18:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 18:18:29,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:18:29,774 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] [2019-01-01 18:18:29,775 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:18:29,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:18:29,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1775313808, now seen corresponding path program 1 times [2019-01-01 18:18:29,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:18:29,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:18:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:18:29,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:18:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:18:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:18:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:18:30,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:18:30,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:18:30,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:18:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:18:30,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:18:30,460 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-01 18:18:30,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:30,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:30,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:18:30,468 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 13 treesize of output 10 [2019-01-01 18:18:30,470 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 10 treesize of output 9 [2019-01-01 18:18:30,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:30,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:30,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:30,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-01-01 18:18:32,234 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 18:18:32,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:18:32,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:18:32,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2019-01-01 18:18:32,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:32,265 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 33 treesize of output 26 [2019-01-01 18:18:32,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:18:32,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2019-01-01 18:18:32,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:32,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:32,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:18:32,294 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:27 [2019-01-01 18:18:32,552 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 25 [2019-01-01 18:18:32,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 10 [2019-01-01 18:18:32,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:32,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:32,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:18:32,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:15 [2019-01-01 18:18:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:18:32,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:18:32,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 30 [2019-01-01 18:18:32,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-01 18:18:32,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-01 18:18:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=827, Unknown=2, NotChecked=0, Total=930 [2019-01-01 18:18:32,706 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 31 states. [2019-01-01 18:18:49,683 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-01-01 18:18:51,565 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-01-01 18:18:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:18:53,862 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-01-01 18:18:53,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 18:18:53,863 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2019-01-01 18:18:53,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:18:53,865 INFO L225 Difference]: With dead ends: 111 [2019-01-01 18:18:53,865 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 18:18:53,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=277, Invalid=2368, Unknown=7, NotChecked=0, Total=2652 [2019-01-01 18:18:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 18:18:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-01-01 18:18:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 18:18:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-01-01 18:18:53,870 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 49 [2019-01-01 18:18:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:18:53,871 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-01-01 18:18:53,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-01 18:18:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-01-01 18:18:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 18:18:53,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:18:53,872 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] [2019-01-01 18:18:53,873 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:18:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:18:53,873 INFO L82 PathProgramCache]: Analyzing trace with hash 914123392, now seen corresponding path program 1 times [2019-01-01 18:18:53,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:18:53,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:18:53,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:18:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:18:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:18:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:18:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:18:54,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:18:54,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:18:54,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:18:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:18:54,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:18:54,977 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-01 18:18:54,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:55,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:55,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 18:18:55,186 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 13 treesize of output 10 [2019-01-01 18:18:55,191 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 10 treesize of output 9 [2019-01-01 18:18:55,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:18:55,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:55,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:18:55,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-01 18:19:07,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:19:07,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:19:07,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2019-01-01 18:19:07,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:19:07,415 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 33 treesize of output 26 [2019-01-01 18:19:07,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:19:07,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2019-01-01 18:19:07,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:19:07,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:19:07,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:19:07,436 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:35 [2019-01-01 18:19:07,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2019-01-01 18:19:07,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:19:07,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 18:19:07,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:18 [2019-01-01 18:19:12,159 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 18:19:12,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:19:12,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-01 18:19:12,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:19:12,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 18:19:12,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:35 [2019-01-01 18:19:12,224 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 30 treesize of output 24 [2019-01-01 18:19:12,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:19:12,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:19:12,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2019-01-01 18:19:12,230 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-01 18:19:12,235 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-01 18:19:12,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:19:12,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-01-01 18:19:12,281 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-01 18:19:12,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:19:12,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 32 [2019-01-01 18:19:12,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-01 18:19:12,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-01 18:19:12,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=957, Unknown=7, NotChecked=0, Total=1056 [2019-01-01 18:19:12,302 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 33 states. [2019-01-01 18:19:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:29,472 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2019-01-01 18:19:29,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 18:19:29,474 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2019-01-01 18:19:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:29,476 INFO L225 Difference]: With dead ends: 118 [2019-01-01 18:19:29,476 INFO L226 Difference]: Without dead ends: 118 [2019-01-01 18:19:29,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=219, Invalid=2126, Unknown=7, NotChecked=0, Total=2352 [2019-01-01 18:19:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-01 18:19:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2019-01-01 18:19:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 18:19:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-01-01 18:19:29,481 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 51 [2019-01-01 18:19:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:29,481 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-01-01 18:19:29,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-01 18:19:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-01-01 18:19:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 18:19:29,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:29,482 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] [2019-01-01 18:19:29,482 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:29,483 INFO L82 PathProgramCache]: Analyzing trace with hash 146835797, now seen corresponding path program 1 times [2019-01-01 18:19:29,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:29,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:29,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:29,921 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 18:19:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:19:30,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:19:30,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 18:19:30,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 18:19:30,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 18:19:30,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:19:30,279 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 10 states. [2019-01-01 18:19:30,999 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-01-01 18:19:31,250 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 18:19:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:32,270 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-01 18:19:32,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:19:32,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-01-01 18:19:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:32,272 INFO L225 Difference]: With dead ends: 107 [2019-01-01 18:19:32,272 INFO L226 Difference]: Without dead ends: 107 [2019-01-01 18:19:32,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:19:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-01 18:19:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-01 18:19:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 18:19:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-01-01 18:19:32,276 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 52 [2019-01-01 18:19:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:32,276 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-01-01 18:19:32,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 18:19:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-01-01 18:19:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 18:19:32,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:32,283 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] [2019-01-01 18:19:32,286 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:32,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash 146835798, now seen corresponding path program 1 times [2019-01-01 18:19:32,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:32,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:32,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:32,828 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-01 18:19:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:19:33,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:19:33,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:19:33,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:19:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:19:33,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:19:33,075 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 8 states. [2019-01-01 18:19:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:33,162 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-01-01 18:19:33,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:19:33,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-01-01 18:19:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:33,165 INFO L225 Difference]: With dead ends: 106 [2019-01-01 18:19:33,165 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 18:19:33,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-01 18:19:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 18:19:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-01 18:19:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 18:19:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2019-01-01 18:19:33,169 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 52 [2019-01-01 18:19:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:33,170 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2019-01-01 18:19:33,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:19:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2019-01-01 18:19:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 18:19:33,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:33,171 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] [2019-01-01 18:19:33,171 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 256942398, now seen corresponding path program 1 times [2019-01-01 18:19:33,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:33,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:19:33,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:19:33,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 18:19:33,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 18:19:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 18:19:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-01 18:19:33,413 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 15 states. [2019-01-01 18:19:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:33,685 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-01 18:19:33,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 18:19:33,688 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2019-01-01 18:19:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:33,689 INFO L225 Difference]: With dead ends: 105 [2019-01-01 18:19:33,689 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 18:19:33,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-01-01 18:19:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 18:19:33,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-01 18:19:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 18:19:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-01-01 18:19:33,695 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 53 [2019-01-01 18:19:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:33,695 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-01-01 18:19:33,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 18:19:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-01-01 18:19:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 18:19:33,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:33,696 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] [2019-01-01 18:19:33,697 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash -624720203, now seen corresponding path program 1 times [2019-01-01 18:19:33,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:33,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:33,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:19:33,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:19:33,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 18:19:33,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 18:19:33,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 18:19:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-01 18:19:33,986 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 15 states. [2019-01-01 18:19:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:34,478 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2019-01-01 18:19:34,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 18:19:34,480 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-01-01 18:19:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:34,481 INFO L225 Difference]: With dead ends: 127 [2019-01-01 18:19:34,481 INFO L226 Difference]: Without dead ends: 127 [2019-01-01 18:19:34,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-01-01 18:19:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-01 18:19:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-01-01 18:19:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 18:19:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2019-01-01 18:19:34,495 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 54 [2019-01-01 18:19:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:34,499 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2019-01-01 18:19:34,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 18:19:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2019-01-01 18:19:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 18:19:34,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:34,500 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 18:19:34,500 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1660143252, now seen corresponding path program 1 times [2019-01-01 18:19:34,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:34,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:19:34,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:19:34,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 18:19:34,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:19:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:19:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:19:34,645 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 6 states. [2019-01-01 18:19:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:34,696 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-01 18:19:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:19:34,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-01 18:19:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:34,699 INFO L225 Difference]: With dead ends: 94 [2019-01-01 18:19:34,700 INFO L226 Difference]: Without dead ends: 88 [2019-01-01 18:19:34,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:19:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-01 18:19:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-01-01 18:19:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-01 18:19:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-01-01 18:19:34,703 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 54 [2019-01-01 18:19:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:34,703 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-01-01 18:19:34,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:19:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-01-01 18:19:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 18:19:34,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:34,704 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] [2019-01-01 18:19:34,705 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2108510240, now seen corresponding path program 1 times [2019-01-01 18:19:34,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:34,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:35,445 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-01 18:19:35,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:19:35,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-01 18:19:35,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 18:19:35,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 18:19:35,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-01-01 18:19:35,446 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 23 states. [2019-01-01 18:19:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:36,601 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2019-01-01 18:19:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 18:19:36,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2019-01-01 18:19:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:36,606 INFO L225 Difference]: With dead ends: 92 [2019-01-01 18:19:36,606 INFO L226 Difference]: Without dead ends: 92 [2019-01-01 18:19:36,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 18:19:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-01 18:19:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-01 18:19:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 18:19:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-01-01 18:19:36,612 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 55 [2019-01-01 18:19:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:36,612 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2019-01-01 18:19:36,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 18:19:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2019-01-01 18:19:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-01 18:19:36,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:36,616 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] [2019-01-01 18:19:36,617 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1233328194, now seen corresponding path program 1 times [2019-01-01 18:19:36,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:36,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:36,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 18:19:37,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:19:37,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:19:37,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:37,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:19:37,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:19:37,296 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 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 18:19:37,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-01 18:19:37,315 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 2 xjuncts. [2019-01-01 18:19:37,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2019-01-01 18:19:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:19:37,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:19:37,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 24 [2019-01-01 18:19:37,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 18:19:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 18:19:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-01-01 18:19:37,471 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 25 states. [2019-01-01 18:19:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:38,683 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2019-01-01 18:19:38,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 18:19:38,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2019-01-01 18:19:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:38,687 INFO L225 Difference]: With dead ends: 92 [2019-01-01 18:19:38,687 INFO L226 Difference]: Without dead ends: 92 [2019-01-01 18:19:38,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 18:19:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-01 18:19:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-01-01 18:19:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 18:19:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-01-01 18:19:38,691 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 59 [2019-01-01 18:19:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:38,692 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-01-01 18:19:38,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 18:19:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-01-01 18:19:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-01 18:19:38,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:38,693 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-01 18:19:38,693 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash -420906418, now seen corresponding path program 1 times [2019-01-01 18:19:38,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:38,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:38,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:19:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 18:19:38,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:19:38,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 18:19:38,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:19:38,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:19:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:19:38,934 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 8 states. [2019-01-01 18:19:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:19:38,964 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-01 18:19:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:19:38,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-01-01 18:19:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:19:38,968 INFO L225 Difference]: With dead ends: 91 [2019-01-01 18:19:38,968 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 18:19:38,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 18:19:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 18:19:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-01 18:19:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 18:19:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2019-01-01 18:19:38,972 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 60 [2019-01-01 18:19:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:19:38,973 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2019-01-01 18:19:38,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:19:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2019-01-01 18:19:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 18:19:38,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:19:38,974 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, 1, 1] [2019-01-01 18:19:38,974 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err8ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2019-01-01 18:19:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:19:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1364954014, now seen corresponding path program 1 times [2019-01-01 18:19:38,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:19:38,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:19:38,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:38,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:19:38,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:19:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 18:19:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 18:19:39,060 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 18:19:39,109 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-01 18:19:39,111 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 12 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-01 18:19:39,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 06:19:39 BoogieIcfgContainer [2019-01-01 18:19:39,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 18:19:39,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 18:19:39,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 18:19:39,150 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 18:19:39,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:16:40" (3/4) ... [2019-01-01 18:19:39,163 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 18:19:39,174 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-01 18:19:39,174 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 12 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-01 18:19:39,249 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 18:19:39,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 18:19:39,254 INFO L168 Benchmark]: Toolchain (without parser) took 182297.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -239.7 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. [2019-01-01 18:19:39,254 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:19:39,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 920.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-01-01 18:19:39,255 INFO L168 Benchmark]: Boogie Preprocessor took 152.36 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-01 18:19:39,255 INFO L168 Benchmark]: RCFGBuilder took 2578.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 113.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. [2019-01-01 18:19:39,255 INFO L168 Benchmark]: TraceAbstraction took 178535.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 995.8 MB in the beginning and 1.2 GB in the end (delta: -201.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:19:39,260 INFO L168 Benchmark]: Witness Printer took 99.27 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-01-01 18:19:39,265 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 920.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 152.36 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 2578.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 113.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 178535.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 995.8 MB in the beginning and 1.2 GB in the end (delta: -201.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 99.27 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 12 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 12 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1478]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={6:0}] [L1492] CALL entry_point() VAL [ldv_global_msg_list={6:0}] [L1483] struct A19 a19; VAL [a19={7:0}, ldv_global_msg_list={6:0}] [L1484] CALL, EXPR probe_unsafe_19(&a19) VAL [a={7:0}, ldv_global_msg_list={6:0}] [L1455] int ret = - -3; VAL [a={7:0}, a={7:0}, ldv_global_msg_list={6:0}, ret=3] [L1457] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={6:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={10:0}, ldv_global_msg_list={6:0}, malloc(size)={10:0}, size=4] [L1457] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={6:0}, ldv_malloc(sizeof(int))={10:0}, ret=3] [L1457] a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={6:0}, ldv_malloc(sizeof(int))={10:0}, ret=3] [L1458] EXPR a->q VAL [a={7:0}, a={7:0}, a->q={10:0}, ldv_global_msg_list={6:0}, ret=3] [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) VAL [a={7:0}, ldv_global_msg_list={6:0}] [L1440] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={6:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={9:0}, ldv_global_msg_list={6:0}, malloc(size)={9:0}, size=4] [L1440] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={6:0}, ldv_malloc(sizeof(int))={9:0}] [L1440] a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={6:0}, ldv_malloc(sizeof(int))={9:0}] [L1441] a->p VAL [a={7:0}, a={7:0}, a->p={9:0}, ldv_global_msg_list={6:0}] [L1441] COND TRUE a->p [L1442] return 0; VAL [\result=0, a={7:0}, a={7:0}, ldv_global_msg_list={6:0}] [L1460] RET, EXPR f19(a) VAL [a={7:0}, a={7:0}, f19(a)=0, ldv_global_msg_list={6:0}, ret=3] [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={6:0}, ret=0] [L1464] CALL, EXPR g19() VAL [ldv_global_msg_list={6:0}] [L1451] return __VERIFIER_nondet_int(); [L1464] RET, EXPR g19() VAL [a={7:0}, a={7:0}, g19()=0, ldv_global_msg_list={6:0}, ret=0] [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) VAL [a={7:0}, ldv_global_msg_list={6:0}] [L1447] EXPR a->p VAL [a={7:0}, a={7:0}, a->p={9:0}, ldv_global_msg_list={6:0}] [L1447] free(a->p) VAL [a={7:0}, a={7:0}, a->p={9:0}, ldv_global_msg_list={6:0}] [L1447] free(a->p) VAL [a={7:0}, a={7:0}, a->p={9:0}, ldv_global_msg_list={6:0}] [L1447] free(a->p) [L1470] RET f19_undo(a) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={6:0}, ret=0] [L1472] EXPR a->q VAL [a={7:0}, a={7:0}, a->q={10:0}, ldv_global_msg_list={6:0}, ret=0] [L1472] free(a->q) VAL [a={7:0}, a={7:0}, a->q={10:0}, ldv_global_msg_list={6:0}, ret=0] [L1472] free(a->q) VAL [a={7:0}, a={7:0}, a->q={10:0}, ldv_global_msg_list={6:0}, ret=0] [L1472] free(a->q) [L1474] return ret; VAL [\result=0, a={7:0}, a={7:0}, ldv_global_msg_list={6:0}, ret=0] [L1484] RET, EXPR probe_unsafe_19(&a19) VAL [a19={7:0}, ldv_global_msg_list={6:0}, probe_unsafe_19(&a19)=0] [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 VAL [a19={7:0}, ldv_global_msg_list={6:0}, ret=0] [L1487] CALL disconnect_19(&a19) VAL [a={7:0}, ldv_global_msg_list={6:0}] [L1478] EXPR a->q VAL [a={7:0}, a={7:0}, a->q={10:0}, ldv_global_msg_list={6:0}] [L1478] free(a->q) VAL [a={7:0}, a={7:0}, a->q={10:0}, ldv_global_msg_list={6:0}] [L1478] free(a->q) VAL [a={7:0}, a={7:0}, a->q={10:0}, ldv_global_msg_list={6:0}] [L1478] free(a->q) VAL [a={7:0}, a={7:0}, a->q={10:0}, ldv_global_msg_list={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 48 procedures, 388 locations, 94 error locations. UNSAFE Result, 178.4s OverallTime, 39 OverallIterations, 2 TraceHistogramMax, 121.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2906 SDtfs, 2572 SDslu, 15035 SDs, 0 SdLazy, 13349 SolverSat, 783 SolverUnsat, 99 SolverUnknown, 0 SolverNotchecked, 84.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1091 GetRequests, 421 SyntacticMatches, 21 SemanticMatches, 649 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 85.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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, 38 MinimizatonAttempts, 327 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 54.3s InterpolantComputationTime, 2097 NumberOfCodeBlocks, 2097 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1987 ConstructedInterpolants, 103 QuantifiedInterpolants, 670286 SizeOfPredicates, 93 NumberOfNonLiveVariables, 2440 ConjunctsInSsa, 291 ConjunctsInUnsatCore, 48 InterpolantComputations, 33 PerfectInterpolantSequences, 142/172 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...