./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.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 629d5a636c5f2810554fe722d7d0f8126d0f15df ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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_test17_1_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 629d5a636c5f2810554fe722d7d0f8126d0f15df ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-0ed9222-m [2019-01-14 19:18:39,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:18:39,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:18:39,096 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:18:39,096 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:18:39,097 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:18:39,098 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:18:39,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:18:39,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:18:39,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:18:39,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:18:39,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:18:39,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:18:39,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:18:39,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:18:39,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:18:39,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:18:39,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:18:39,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:18:39,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:18:39,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:18:39,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:18:39,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:18:39,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:18:39,129 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:18:39,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:18:39,131 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:18:39,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:18:39,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:18:39,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:18:39,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:18:39,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:18:39,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:18:39,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:18:39,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:18:39,137 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:18:39,138 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 19:18:39,151 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:18:39,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:18:39,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:18:39,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:18:39,153 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:18:39,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:18:39,154 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:18:39,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:18:39,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:18:39,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:18:39,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:18:39,154 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:18:39,155 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:18:39,155 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:18:39,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:18:39,155 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:18:39,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:18:39,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:18:39,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:18:39,156 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:18:39,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:18:39,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:18:39,157 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:18:39,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 19:18:39,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:18:39,157 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 -> 629d5a636c5f2810554fe722d7d0f8126d0f15df [2019-01-14 19:18:39,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:18:39,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:18:39,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:18:39,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:18:39,210 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:18:39,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2019-01-14 19:18:39,270 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3b96dd7/f836d1d1724f4e9cb937a6b8f2fcb738/FLAGba3d463c3 [2019-01-14 19:18:39,858 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:18:39,859 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2019-01-14 19:18:39,876 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3b96dd7/f836d1d1724f4e9cb937a6b8f2fcb738/FLAGba3d463c3 [2019-01-14 19:18:40,071 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3b96dd7/f836d1d1724f4e9cb937a6b8f2fcb738 [2019-01-14 19:18:40,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:18:40,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:18:40,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:18:40,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:18:40,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:18:40,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c56c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40, skipping insertion in model container [2019-01-14 19:18:40,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:18:40,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:18:40,586 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:18:40,603 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:18:40,755 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:18:40,847 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:18:40,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40 WrapperNode [2019-01-14 19:18:40,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:18:40,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:18:40,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:18:40,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:18:40,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (1/1) ... [2019-01-14 19:18:40,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:18:40,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:18:40,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:18:40,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:18:40,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:18:41,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:18:41,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:18:41,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:18:41,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 19:18:41,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 19:18:41,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-14 19:18:41,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-14 19:18:41,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-14 19:18:41,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-14 19:18:41,031 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-14 19:18:41,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-14 19:18:41,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-14 19:18:41,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-14 19:18:41,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-14 19:18:41,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-14 19:18:41,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-14 19:18:41,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-14 19:18:41,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-14 19:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-14 19:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-14 19:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-14 19:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-14 19:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-14 19:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-14 19:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-14 19:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-14 19:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-14 19:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-14 19:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-14 19:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-14 19:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-14 19:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-14 19:18:41,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-14 19:18:41,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-14 19:18:41,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-14 19:18:41,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-14 19:18:41,035 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 19:18:41,035 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 19:18:41,035 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_17 [2019-01-14 19:18:41,036 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-01-14 19:18:41,036 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-14 19:18:41,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:18:41,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-14 19:18:41,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-14 19:18:41,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-14 19:18:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 19:18:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 19:18:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 19:18:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 19:18:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 19:18:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 19:18:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 19:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 19:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 19:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 19:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 19:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 19:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 19:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 19:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 19:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 19:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 19:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 19:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 19:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 19:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 19:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 19:18:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 19:18:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 19:18:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 19:18:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 19:18:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 19:18:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 19:18:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 19:18:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 19:18:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 19:18:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 19:18:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 19:18:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 19:18:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 19:18:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 19:18:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 19:18:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 19:18:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 19:18:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 19:18:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 19:18:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 19:18:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 19:18:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 19:18:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 19:18:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 19:18:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 19:18:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 19:18:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 19:18:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 19:18:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 19:18:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 19:18:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 19:18:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 19:18:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 19:18:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 19:18:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 19:18:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 19:18:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 19:18:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 19:18:41,044 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 19:18:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 19:18:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 19:18:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 19:18:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 19:18:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 19:18:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 19:18:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 19:18:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 19:18:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 19:18:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 19:18:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 19:18:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 19:18:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 19:18:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 19:18:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 19:18:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 19:18:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 19:18:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 19:18:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 19:18:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 19:18:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 19:18:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 19:18:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 19:18:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 19:18:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 19:18:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 19:18:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 19:18:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 19:18:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 19:18:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 19:18:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 19:18:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 19:18:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 19:18:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 19:18:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 19:18:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 19:18:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 19:18:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 19:18:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 19:18:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 19:18:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 19:18:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-14 19:18:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 19:18:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-14 19:18:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-14 19:18:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-14 19:18:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-14 19:18:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-14 19:18:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-14 19:18:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 19:18:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-14 19:18:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-14 19:18:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-14 19:18:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 19:18:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-14 19:18:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-14 19:18:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-14 19:18:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 19:18:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-14 19:18:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-14 19:18:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-14 19:18:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-14 19:18:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-14 19:18:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-14 19:18:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:18:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-14 19:18:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-14 19:18:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-14 19:18:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-14 19:18:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-14 19:18:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 19:18:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 19:18:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-14 19:18:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-14 19:18:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:18:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-14 19:18:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-14 19:18:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-14 19:18:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-14 19:18:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-14 19:18:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-14 19:18:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-14 19:18:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-14 19:18:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-14 19:18:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-14 19:18:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_17 [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:18:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 19:18:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 19:18:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:18:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-14 19:18:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-14 19:18:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-14 19:18:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-14 19:18:41,833 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 19:18:42,565 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 19:18:43,303 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:18:43,304 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 19:18:43,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:18:43 BoogieIcfgContainer [2019-01-14 19:18:43,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:18:43,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:18:43,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:18:43,311 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:18:43,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:18:40" (1/3) ... [2019-01-14 19:18:43,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443136ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:18:43, skipping insertion in model container [2019-01-14 19:18:43,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:18:40" (2/3) ... [2019-01-14 19:18:43,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443136ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:18:43, skipping insertion in model container [2019-01-14 19:18:43,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:18:43" (3/3) ... [2019-01-14 19:18:43,316 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2019-01-14 19:18:43,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:18:43,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-01-14 19:18:43,352 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-01-14 19:18:43,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:18:43,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:18:43,379 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:18:43,379 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:18:43,379 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:18:43,379 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:18:43,380 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:18:43,380 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:18:43,380 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:18:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-01-14 19:18:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:18:43,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:43,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:43,416 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 100287869, now seen corresponding path program 1 times [2019-01-14 19:18:43,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:43,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:43,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:43,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:43,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:18:43,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:18:43,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:18:43,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:18:43,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:18:43,777 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 5 states. [2019-01-14 19:18:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:44,137 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-01-14 19:18:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:18:44,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 19:18:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:44,150 INFO L225 Difference]: With dead ends: 81 [2019-01-14 19:18:44,151 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 19:18:44,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-14 19:18:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 19:18:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-01-14 19:18:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 19:18:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-01-14 19:18:44,205 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 16 [2019-01-14 19:18:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:44,205 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-01-14 19:18:44,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:18:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-01-14 19:18:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:18:44,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:44,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:44,211 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 100287870, now seen corresponding path program 1 times [2019-01-14 19:18:44,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:44,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:44,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:44,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:44,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:44,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:18:44,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:18:44,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:18:44,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:18:44,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:18:44,771 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 8 states. [2019-01-14 19:18:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:45,074 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-01-14 19:18:45,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:18:45,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-14 19:18:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:45,078 INFO L225 Difference]: With dead ends: 85 [2019-01-14 19:18:45,078 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 19:18:45,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:18:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 19:18:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-01-14 19:18:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 19:18:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-01-14 19:18:45,095 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 16 [2019-01-14 19:18:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:45,095 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-01-14 19:18:45,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:18:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-01-14 19:18:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:18:45,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:45,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:45,098 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:45,100 INFO L82 PathProgramCache]: Analyzing trace with hash 987791550, now seen corresponding path program 1 times [2019-01-14 19:18:45,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:45,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:45,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:45,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:45,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:45,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:18:45,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:18:45,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:18:45,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:18:45,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:18:45,206 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 5 states. [2019-01-14 19:18:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:45,280 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-01-14 19:18:45,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:18:45,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 19:18:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:45,284 INFO L225 Difference]: With dead ends: 75 [2019-01-14 19:18:45,285 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 19:18:45,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:18:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 19:18:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-14 19:18:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 19:18:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-01-14 19:18:45,297 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2019-01-14 19:18:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:45,298 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-01-14 19:18:45,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:18:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-01-14 19:18:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 19:18:45,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:45,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:45,300 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1186059597, now seen corresponding path program 1 times [2019-01-14 19:18:45,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:45,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:45,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:45,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:45,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:45,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:18:45,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:18:45,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:18:45,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:18:45,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:18:45,385 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 5 states. [2019-01-14 19:18:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:45,411 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-01-14 19:18:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:18:45,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-14 19:18:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:45,415 INFO L225 Difference]: With dead ends: 75 [2019-01-14 19:18:45,415 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 19:18:45,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:18:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 19:18:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-14 19:18:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 19:18:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-01-14 19:18:45,424 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2019-01-14 19:18:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:45,424 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-01-14 19:18:45,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:18:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-01-14 19:18:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 19:18:45,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:45,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:45,426 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:45,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:45,427 INFO L82 PathProgramCache]: Analyzing trace with hash 556750738, now seen corresponding path program 1 times [2019-01-14 19:18:45,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:45,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:45,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:45,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:45,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:18:45,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:18:45,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:18:45,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:18:45,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:18:45,481 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 3 states. [2019-01-14 19:18:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:45,594 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-01-14 19:18:45,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:18:45,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 19:18:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:45,597 INFO L225 Difference]: With dead ends: 111 [2019-01-14 19:18:45,597 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 19:18:45,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:18:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 19:18:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 71. [2019-01-14 19:18:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 19:18:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-01-14 19:18:45,605 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2019-01-14 19:18:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:45,606 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-01-14 19:18:45,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:18:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-01-14 19:18:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 19:18:45,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:45,607 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:45,608 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1620936588, now seen corresponding path program 1 times [2019-01-14 19:18:45,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:45,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:45,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:45,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:45,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:18:45,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:45,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:45,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:18:45,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:18:45,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:18:45,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-14 19:18:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:46,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:18:46,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 19:18:46,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 19:18:46,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 19:18:46,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:18:46,485 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 14 states. [2019-01-14 19:18:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:47,341 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-01-14 19:18:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 19:18:47,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-01-14 19:18:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:47,345 INFO L225 Difference]: With dead ends: 76 [2019-01-14 19:18:47,345 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 19:18:47,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-01-14 19:18:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 19:18:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-01-14 19:18:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 19:18:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-01-14 19:18:47,355 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2019-01-14 19:18:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:47,356 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-01-14 19:18:47,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 19:18:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-01-14 19:18:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 19:18:47,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:47,361 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] [2019-01-14 19:18:47,361 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1612957325, now seen corresponding path program 1 times [2019-01-14 19:18:47,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:47,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:47,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:47,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:47,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 19:18:47,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:18:47,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:18:47,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:18:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:18:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:18:47,542 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 8 states. [2019-01-14 19:18:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:48,065 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2019-01-14 19:18:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:18:48,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-01-14 19:18:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:48,067 INFO L225 Difference]: With dead ends: 123 [2019-01-14 19:18:48,067 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 19:18:48,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:18:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 19:18:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2019-01-14 19:18:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 19:18:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2019-01-14 19:18:48,085 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 32 [2019-01-14 19:18:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:48,085 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2019-01-14 19:18:48,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:18:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2019-01-14 19:18:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 19:18:48,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:48,090 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] [2019-01-14 19:18:48,091 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:48,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1612957326, now seen corresponding path program 1 times [2019-01-14 19:18:48,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:48,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:48,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:48,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:48,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:18:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:48,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:48,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:18:48,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-14 19:18:48,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:18:48,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:18:48,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:18:48,531 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand 9 states. [2019-01-14 19:18:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:48,582 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2019-01-14 19:18:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:18:48,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-01-14 19:18:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:48,585 INFO L225 Difference]: With dead ends: 99 [2019-01-14 19:18:48,585 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 19:18:48,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:18:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 19:18:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-01-14 19:18:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 19:18:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2019-01-14 19:18:48,592 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 32 [2019-01-14 19:18:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:48,592 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2019-01-14 19:18:48,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:18:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2019-01-14 19:18:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 19:18:48,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:48,594 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:48,594 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:48,595 INFO L82 PathProgramCache]: Analyzing trace with hash -635220604, now seen corresponding path program 2 times [2019-01-14 19:18:48,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:48,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:48,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:48,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:48,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:48,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:48,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:18:48,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:18:48,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 19:18:48,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:18:48,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-14 19:18:48,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:18:48,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-01-14 19:18:48,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:18:48,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:18:48,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:18:48,947 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 9 states. [2019-01-14 19:18:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:49,141 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2019-01-14 19:18:49,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:18:49,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-01-14 19:18:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:49,152 INFO L225 Difference]: With dead ends: 140 [2019-01-14 19:18:49,153 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 19:18:49,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:18:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 19:18:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 101. [2019-01-14 19:18:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 19:18:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2019-01-14 19:18:49,171 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 35 [2019-01-14 19:18:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:49,171 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2019-01-14 19:18:49,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:18:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2019-01-14 19:18:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 19:18:49,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:49,179 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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-14 19:18:49,180 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:49,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:49,181 INFO L82 PathProgramCache]: Analyzing trace with hash 174243339, now seen corresponding path program 1 times [2019-01-14 19:18:49,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:49,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:49,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:18:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:18:49,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:49,352 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-14 19:18:49,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:49,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:49,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:18:49,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 19:18:49,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 19:18:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 19:18:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:18:49,601 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 13 states. [2019-01-14 19:18:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:49,692 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2019-01-14 19:18:49,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:18:49,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-01-14 19:18:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:49,696 INFO L225 Difference]: With dead ends: 106 [2019-01-14 19:18:49,697 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 19:18:49,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:18:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 19:18:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-01-14 19:18:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 19:18:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2019-01-14 19:18:49,703 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 38 [2019-01-14 19:18:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:49,703 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-01-14 19:18:49,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 19:18:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2019-01-14 19:18:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 19:18:49,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:49,704 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 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-14 19:18:49,705 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 560116865, now seen corresponding path program 2 times [2019-01-14 19:18:49,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:49,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:49,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:18:49,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:49,929 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-14 19:18:49,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:18:49,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 19:18:49,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:18:49,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:50,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:18:50,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-14 19:18:50,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 19:18:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 19:18:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:18:50,107 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 15 states. [2019-01-14 19:18:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:50,307 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2019-01-14 19:18:50,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:18:50,308 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-01-14 19:18:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:50,311 INFO L225 Difference]: With dead ends: 109 [2019-01-14 19:18:50,311 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 19:18:50,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:18:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 19:18:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-01-14 19:18:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 19:18:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2019-01-14 19:18:50,319 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 41 [2019-01-14 19:18:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:50,321 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2019-01-14 19:18:50,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 19:18:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2019-01-14 19:18:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 19:18:50,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:50,324 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 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-14 19:18:50,326 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:50,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:50,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1509121461, now seen corresponding path program 3 times [2019-01-14 19:18:50,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:50,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:50,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:50,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:18:50,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:18:51,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:51,104 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-14 19:18:51,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 19:18:51,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 19:18:51,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:18:51,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:51,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:18:51,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:18:51,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:18:51,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:18:51,617 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| 1))) is different from true [2019-01-14 19:18:51,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 19:18:51,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:18:51,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:18:51,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-14 19:18:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 2 not checked. [2019-01-14 19:18:51,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:18:51,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-01-14 19:18:51,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 19:18:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 19:18:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=190, Unknown=1, NotChecked=28, Total=272 [2019-01-14 19:18:51,957 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand 17 states. [2019-01-14 19:18:52,695 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 19:18:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:53,479 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2019-01-14 19:18:53,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 19:18:53,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-14 19:18:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:53,482 INFO L225 Difference]: With dead ends: 144 [2019-01-14 19:18:53,482 INFO L226 Difference]: Without dead ends: 144 [2019-01-14 19:18:53,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=167, Invalid=705, Unknown=2, NotChecked=56, Total=930 [2019-01-14 19:18:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-14 19:18:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2019-01-14 19:18:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 19:18:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2019-01-14 19:18:53,488 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 44 [2019-01-14 19:18:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:53,489 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2019-01-14 19:18:53,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 19:18:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2019-01-14 19:18:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 19:18:53,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:53,490 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 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-14 19:18:53,491 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash -522491838, now seen corresponding path program 1 times [2019-01-14 19:18:53,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:53,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:18:53,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:18:53,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:53,655 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-14 19:18:53,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:53,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:53,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:18:53,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-14 19:18:53,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-14 19:18:53,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 19:18:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-01-14 19:18:53,877 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 19 states. [2019-01-14 19:18:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:53,966 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2019-01-14 19:18:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 19:18:53,967 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2019-01-14 19:18:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:53,969 INFO L225 Difference]: With dead ends: 113 [2019-01-14 19:18:53,969 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 19:18:53,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-01-14 19:18:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 19:18:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-01-14 19:18:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 19:18:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2019-01-14 19:18:53,975 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 47 [2019-01-14 19:18:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:53,975 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2019-01-14 19:18:53,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-14 19:18:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2019-01-14 19:18:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 19:18:53,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:53,976 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:53,977 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1699370636, now seen corresponding path program 2 times [2019-01-14 19:18:53,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:53,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:53,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:18:54,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:54,228 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-14 19:18:54,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:18:54,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 19:18:54,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:18:54,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:18:54,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:18:54,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-14 19:18:54,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 19:18:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 19:18:54,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-01-14 19:18:54,480 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand 21 states. [2019-01-14 19:18:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:54,594 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-01-14 19:18:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 19:18:54,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-01-14 19:18:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:54,598 INFO L225 Difference]: With dead ends: 116 [2019-01-14 19:18:54,598 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 19:18:54,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-01-14 19:18:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 19:18:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-01-14 19:18:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 19:18:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2019-01-14 19:18:54,607 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 50 [2019-01-14 19:18:54,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:54,607 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2019-01-14 19:18:54,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 19:18:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2019-01-14 19:18:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 19:18:54,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:54,610 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 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-14 19:18:54,610 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash -831632382, now seen corresponding path program 3 times [2019-01-14 19:18:54,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:54,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:54,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:18:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:18:54,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:18:54,785 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-14 19:18:54,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 19:18:54,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 19:18:54,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:18:54,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:18:54,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:18:54,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:18:54,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:18:54,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:18:54,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:18:54,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-01-14 19:18:55,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:18:55,283 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 14 treesize of output 17 [2019-01-14 19:18:55,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:18:55,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:18:55,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:18:55,338 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 19:18:55,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:18:55,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:18:55,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2019-01-14 19:18:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-14 19:18:55,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:18:55,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-01-14 19:18:55,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 19:18:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 19:18:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2019-01-14 19:18:55,405 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 22 states. [2019-01-14 19:18:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:59,544 INFO L93 Difference]: Finished difference Result 227 states and 254 transitions. [2019-01-14 19:18:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 19:18:59,547 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2019-01-14 19:18:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:59,549 INFO L225 Difference]: With dead ends: 227 [2019-01-14 19:18:59,549 INFO L226 Difference]: Without dead ends: 227 [2019-01-14 19:18:59,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=1414, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 19:18:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-14 19:18:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 124. [2019-01-14 19:18:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-14 19:18:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2019-01-14 19:18:59,582 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 53 [2019-01-14 19:18:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:59,583 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2019-01-14 19:18:59,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 19:18:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2019-01-14 19:18:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 19:18:59,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:59,584 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:59,585 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1653365160, now seen corresponding path program 1 times [2019-01-14 19:18:59,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:59,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:59,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:59,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:18:59,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-14 19:18:59,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:18:59,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:18:59,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:18:59,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:18:59,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:18:59,768 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand 5 states. [2019-01-14 19:18:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:18:59,808 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2019-01-14 19:18:59,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:18:59,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-14 19:18:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:18:59,811 INFO L225 Difference]: With dead ends: 136 [2019-01-14 19:18:59,812 INFO L226 Difference]: Without dead ends: 136 [2019-01-14 19:18:59,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:18:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-14 19:18:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2019-01-14 19:18:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 19:18:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2019-01-14 19:18:59,824 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 58 [2019-01-14 19:18:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:18:59,826 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2019-01-14 19:18:59,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:18:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2019-01-14 19:18:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 19:18:59,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:18:59,827 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:18:59,829 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:18:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:18:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash 89445175, now seen corresponding path program 1 times [2019-01-14 19:18:59,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:18:59,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:18:59,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:59,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:18:59,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:18:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:18:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-14 19:18:59,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:18:59,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:18:59,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:18:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:18:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:18:59,969 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand 4 states. [2019-01-14 19:19:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:19:00,010 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2019-01-14 19:19:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:19:00,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-14 19:19:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:19:00,013 INFO L225 Difference]: With dead ends: 137 [2019-01-14 19:19:00,013 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 19:19:00,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:19:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 19:19:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2019-01-14 19:19:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-14 19:19:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 147 transitions. [2019-01-14 19:19:00,019 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 147 transitions. Word has length 58 [2019-01-14 19:19:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:19:00,020 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 147 transitions. [2019-01-14 19:19:00,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:19:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2019-01-14 19:19:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 19:19:00,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:19:00,021 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:19:00,021 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:19:00,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:19:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1208407565, now seen corresponding path program 1 times [2019-01-14 19:19:00,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:19:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:19:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:19:00,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:19:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:19:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:19:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 19:19:00,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:19:00,209 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-14 19:19:00,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:19:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:19:00,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:19:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 104 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:19:00,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:19:00,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2019-01-14 19:19:00,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 19:19:00,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 19:19:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-01-14 19:19:00,663 INFO L87 Difference]: Start difference. First operand 128 states and 147 transitions. Second operand 24 states. [2019-01-14 19:19:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:19:02,733 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2019-01-14 19:19:02,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 19:19:02,734 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2019-01-14 19:19:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:19:02,736 INFO L225 Difference]: With dead ends: 175 [2019-01-14 19:19:02,737 INFO L226 Difference]: Without dead ends: 175 [2019-01-14 19:19:02,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 19:19:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-14 19:19:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2019-01-14 19:19:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-14 19:19:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2019-01-14 19:19:02,744 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 65 [2019-01-14 19:19:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:19:02,744 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2019-01-14 19:19:02,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 19:19:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2019-01-14 19:19:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 19:19:02,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:19:02,748 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:19:02,749 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:19:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:19:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1215772687, now seen corresponding path program 1 times [2019-01-14 19:19:02,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:19:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:19:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:19:02,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:19:02,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:19:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:19:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-14 19:19:02,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:19:02,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:19:02,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:19:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:19:02,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:19:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-14 19:19:03,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:19:03,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-01-14 19:19:03,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:19:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:19:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:19:03,072 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand 11 states. [2019-01-14 19:19:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:19:03,520 INFO L93 Difference]: Finished difference Result 250 states and 308 transitions. [2019-01-14 19:19:03,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 19:19:03,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-01-14 19:19:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:19:03,530 INFO L225 Difference]: With dead ends: 250 [2019-01-14 19:19:03,530 INFO L226 Difference]: Without dead ends: 244 [2019-01-14 19:19:03,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-01-14 19:19:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-14 19:19:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 152. [2019-01-14 19:19:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-14 19:19:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2019-01-14 19:19:03,542 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 66 [2019-01-14 19:19:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:19:03,542 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2019-01-14 19:19:03,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:19:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2019-01-14 19:19:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 19:19:03,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:19:03,543 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:19:03,545 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:19:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:19:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash -657609936, now seen corresponding path program 1 times [2019-01-14 19:19:03,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:19:03,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:19:03,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:19:03,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:19:03,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:19:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:19:04,151 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 19:19:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-14 19:19:04,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:19:04,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:19:04,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:19:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:19:04,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:19:04,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:04,901 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 17 treesize of output 20 [2019-01-14 19:19:04,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:04,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:04,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:04,928 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 19:19:04,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:04,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:19:04,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:20 [2019-01-14 19:19:05,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:05,088 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 17 treesize of output 20 [2019-01-14 19:19:05,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:05,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:05,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:05,113 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 19:19:05,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:05,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:19:05,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:20 [2019-01-14 19:19:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 108 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 19:19:05,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:19:05,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2019-01-14 19:19:05,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 19:19:05,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 19:19:05,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2019-01-14 19:19:05,195 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand 32 states. [2019-01-14 19:19:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:19:11,133 INFO L93 Difference]: Finished difference Result 297 states and 344 transitions. [2019-01-14 19:19:11,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 19:19:11,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-01-14 19:19:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:19:11,137 INFO L225 Difference]: With dead ends: 297 [2019-01-14 19:19:11,137 INFO L226 Difference]: Without dead ends: 297 [2019-01-14 19:19:11,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=413, Invalid=3009, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 19:19:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-01-14 19:19:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 165. [2019-01-14 19:19:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-14 19:19:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2019-01-14 19:19:11,171 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 66 [2019-01-14 19:19:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:19:11,172 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2019-01-14 19:19:11,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 19:19:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2019-01-14 19:19:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 19:19:11,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:19:11,178 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:19:11,181 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:19:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:19:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1194070813, now seen corresponding path program 1 times [2019-01-14 19:19:11,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:19:11,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:19:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:19:11,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:19:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:19:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:19:11,580 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-14 19:19:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:19:12,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:19:12,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:19:12,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:19:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:19:12,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:19:12,938 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 15 treesize of output 12 [2019-01-14 19:19:12,943 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 12 treesize of output 11 [2019-01-14 19:19:12,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:12,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:12,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:12,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-01-14 19:19:13,003 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-14 19:19:13,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,018 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 27 [2019-01-14 19:19:13,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 19:19:13,140 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 32 treesize of output 25 [2019-01-14 19:19:13,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2019-01-14 19:19:13,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-14 19:19:13,238 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 41 treesize of output 32 [2019-01-14 19:19:13,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2019-01-14 19:19:13,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-01-14 19:19:13,439 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 52 treesize of output 41 [2019-01-14 19:19:13,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:13,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 136 [2019-01-14 19:19:13,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:13,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:19:13,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2019-01-14 19:19:14,158 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 63 treesize of output 50 [2019-01-14 19:19:14,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 199 [2019-01-14 19:19:14,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:14,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:14,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 19:19:14,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:75 [2019-01-14 19:19:14,443 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 74 treesize of output 59 [2019-01-14 19:19:14,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:14,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 274 [2019-01-14 19:19:14,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:14,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:14,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 19:19:14,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:91 [2019-01-14 19:19:14,999 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 19:19:15,096 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 85 treesize of output 68 [2019-01-14 19:19:15,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 361 [2019-01-14 19:19:15,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:15,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:15,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 19:19:15,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:111, output treesize:107 [2019-01-14 19:19:15,581 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 96 treesize of output 77 [2019-01-14 19:19:15,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:15,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 460 [2019-01-14 19:19:15,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:15,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:15,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-14 19:19:15,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:123 [2019-01-14 19:19:17,540 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 107 treesize of output 86 [2019-01-14 19:19:17,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:17,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 571 [2019-01-14 19:19:17,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:17,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:17,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-14 19:19:17,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2019-01-14 19:19:43,116 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 19:19:45,294 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 19:19:47,429 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 62 [2019-01-14 19:19:47,440 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 92 treesize of output 70 [2019-01-14 19:19:47,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:19:47,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 298 [2019-01-14 19:19:47,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:19:47,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:47,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:19:47,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:125, output treesize:3 [2019-01-14 19:19:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 57 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:19:47,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:19:47,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 47 [2019-01-14 19:19:47,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 19:19:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 19:19:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=1844, Unknown=14, NotChecked=0, Total=2256 [2019-01-14 19:19:47,660 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand 48 states. [2019-01-14 19:20:20,666 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-14 19:20:26,276 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-01-14 19:20:30,759 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-14 19:20:53,097 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-14 19:20:53,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 19:20:53,099 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2019-01-14 19:20:53,103 INFO L168 Benchmark]: Toolchain (without parser) took 133028.01 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 442.0 MB). Free memory was 942.0 MB in the beginning and 961.6 MB in the end (delta: -19.6 MB). Peak memory consumption was 422.3 MB. Max. memory is 11.5 GB. [2019-01-14 19:20:53,104 INFO L168 Benchmark]: CDTParser took 0.17 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-14 19:20:53,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-01-14 19:20:53,107 INFO L168 Benchmark]: Boogie Preprocessor took 121.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:20:53,107 INFO L168 Benchmark]: RCFGBuilder took 2336.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 11.5 GB. [2019-01-14 19:20:53,108 INFO L168 Benchmark]: TraceAbstraction took 129794.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.0 MB). Free memory was 999.0 MB in the beginning and 961.6 MB in the end (delta: 37.4 MB). Peak memory consumption was 329.4 MB. Max. memory is 11.5 GB. [2019-01-14 19:20:53,113 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.17 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 771.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.00 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 2336.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 129794.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.0 MB). Free memory was 999.0 MB in the beginning and 961.6 MB in the end (delta: 37.4 MB). Peak memory consumption was 329.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-14 19:20:55,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:20:55,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:20:55,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:20:55,105 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:20:55,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:20:55,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:20:55,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:20:55,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:20:55,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:20:55,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:20:55,115 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:20:55,116 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:20:55,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:20:55,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:20:55,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:20:55,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:20:55,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:20:55,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:20:55,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:20:55,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:20:55,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:20:55,132 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:20:55,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:20:55,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:20:55,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:20:55,135 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:20:55,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:20:55,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:20:55,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:20:55,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:20:55,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:20:55,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:20:55,141 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:20:55,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:20:55,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:20:55,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-14 19:20:55,160 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:20:55,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:20:55,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:20:55,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:20:55,162 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:20:55,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:20:55,163 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:20:55,163 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:20:55,164 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:20:55,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:20:55,164 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:20:55,164 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:20:55,164 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:20:55,165 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:20:55,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:20:55,165 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 19:20:55,165 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 19:20:55,165 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:20:55,166 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:20:55,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:20:55,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:20:55,168 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:20:55,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:20:55,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:20:55,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:20:55,168 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 19:20:55,169 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:20:55,170 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 19:20:55,170 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 629d5a636c5f2810554fe722d7d0f8126d0f15df [2019-01-14 19:20:55,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:20:55,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:20:55,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:20:55,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:20:55,232 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:20:55,233 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2019-01-14 19:20:55,297 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f671a49/969a824310fc4d98b7dd379e3e1ffa2e/FLAGa5e931e48 [2019-01-14 19:20:55,763 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:20:55,764 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2019-01-14 19:20:55,780 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f671a49/969a824310fc4d98b7dd379e3e1ffa2e/FLAGa5e931e48 [2019-01-14 19:20:56,044 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f671a49/969a824310fc4d98b7dd379e3e1ffa2e [2019-01-14 19:20:56,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:20:56,050 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:20:56,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:20:56,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:20:56,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:20:56,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:56,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4a60d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56, skipping insertion in model container [2019-01-14 19:20:56,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:56,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:20:56,122 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:20:56,581 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:20:56,602 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:20:56,781 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:20:56,864 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:20:56,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56 WrapperNode [2019-01-14 19:20:56,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:20:56,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:20:56,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:20:56,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:20:56,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:56,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:56,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:56,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:56,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:56,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:56,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (1/1) ... [2019-01-14 19:20:57,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:20:57,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:20:57,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:20:57,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:20:57,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:20:57,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:20:57,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:20:57,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:20:57,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 19:20:57,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 19:20:57,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 19:20:57,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-14 19:20:57,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-14 19:20:57,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-14 19:20:57,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-14 19:20:57,088 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-14 19:20:57,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-14 19:20:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-14 19:20:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-14 19:20:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-14 19:20:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-14 19:20:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-14 19:20:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-14 19:20:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-14 19:20:57,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-14 19:20:57,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-14 19:20:57,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-14 19:20:57,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-14 19:20:57,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-14 19:20:57,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-14 19:20:57,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-14 19:20:57,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-14 19:20:57,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-14 19:20:57,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-14 19:20:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-14 19:20:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-14 19:20:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-14 19:20:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-14 19:20:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-14 19:20:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-14 19:20:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-14 19:20:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-14 19:20:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 19:20:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 19:20:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_17 [2019-01-14 19:20:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-01-14 19:20:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-14 19:20:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:20:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-14 19:20:57,096 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-14 19:20:57,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-14 19:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 19:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 19:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 19:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 19:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 19:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 19:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 19:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 19:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 19:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 19:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 19:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 19:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 19:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 19:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 19:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 19:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 19:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 19:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 19:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 19:20:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 19:20:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 19:20:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 19:20:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 19:20:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 19:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 19:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 19:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 19:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 19:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 19:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 19:20:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 19:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 19:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 19:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 19:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 19:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 19:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 19:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 19:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 19:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 19:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 19:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 19:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 19:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 19:20:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 19:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 19:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 19:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 19:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 19:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 19:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 19:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 19:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 19:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 19:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 19:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 19:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 19:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 19:20:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 19:20:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 19:20:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 19:20:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 19:20:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 19:20:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 19:20:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 19:20:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 19:20:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 19:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 19:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 19:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 19:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 19:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 19:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 19:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 19:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 19:20:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 19:20:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 19:20:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 19:20:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 19:20:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 19:20:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 19:20:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 19:20:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 19:20:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 19:20:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 19:20:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 19:20:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 19:20:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 19:20:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 19:20:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 19:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 19:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 19:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 19:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 19:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 19:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 19:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 19:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 19:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 19:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 19:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 19:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-14 19:20:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 19:20:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-14 19:20:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-14 19:20:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-14 19:20:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-14 19:20:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-14 19:20:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-14 19:20:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 19:20:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-14 19:20:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-14 19:20:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-14 19:20:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 19:20:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-14 19:20:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-14 19:20:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-14 19:20:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 19:20:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-14 19:20:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-14 19:20:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-14 19:20:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-14 19:20:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 19:20:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 19:20:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-14 19:20:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-14 19:20:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:20:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-14 19:20:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-14 19:20:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-14 19:20:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-14 19:20:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 19:20:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 19:20:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_17 [2019-01-14 19:20:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-01-14 19:20:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-14 19:20:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:20:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:20:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 19:20:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 19:20:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:20:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 19:20:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-01-14 19:20:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-01-14 19:20:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-14 19:20:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-14 19:20:57,798 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 19:20:58,762 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 19:21:00,067 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:21:00,068 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 19:21:00,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:21:00 BoogieIcfgContainer [2019-01-14 19:21:00,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:21:00,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:21:00,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:21:00,079 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:21:00,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:20:56" (1/3) ... [2019-01-14 19:21:00,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c18563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:21:00, skipping insertion in model container [2019-01-14 19:21:00,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:20:56" (2/3) ... [2019-01-14 19:21:00,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c18563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:21:00, skipping insertion in model container [2019-01-14 19:21:00,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:21:00" (3/3) ... [2019-01-14 19:21:00,085 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2019-01-14 19:21:00,096 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:21:00,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-01-14 19:21:00,127 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-01-14 19:21:00,172 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:21:00,173 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:21:00,174 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:21:00,174 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:21:00,174 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:21:00,174 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:21:00,174 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:21:00,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:21:00,175 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:21:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-01-14 19:21:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:21:00,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:00,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:00,225 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:00,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1122074596, now seen corresponding path program 1 times [2019-01-14 19:21:00,242 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:00,243 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:00,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:00,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:00,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:00,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:00,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:00,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:21:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:00,606 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 19:21:00,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:21:00,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:21:00,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:21:00,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:21:00,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:21:00,638 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 5 states. [2019-01-14 19:21:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:01,090 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-01-14 19:21:01,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:21:01,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 19:21:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:01,112 INFO L225 Difference]: With dead ends: 81 [2019-01-14 19:21:01,115 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 19:21:01,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:21:01,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 19:21:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-01-14 19:21:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 19:21:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-01-14 19:21:01,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 16 [2019-01-14 19:21:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:01,170 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-01-14 19:21:01,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:21:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-01-14 19:21:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:21:01,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:01,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:01,174 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1122074595, now seen corresponding path program 1 times [2019-01-14 19:21:01,175 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:01,177 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:01,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:01,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:01,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:01,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:01,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:01,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:21:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:01,726 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:21:01,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:21:01,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:21:01,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:21:01,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:21:01,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:21:01,734 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 8 states. [2019-01-14 19:21:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:02,178 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2019-01-14 19:21:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:21:02,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-14 19:21:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:02,183 INFO L225 Difference]: With dead ends: 84 [2019-01-14 19:21:02,183 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 19:21:02,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:21:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 19:21:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2019-01-14 19:21:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 19:21:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-01-14 19:21:02,196 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 16 [2019-01-14 19:21:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:02,196 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-01-14 19:21:02,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:21:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-01-14 19:21:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:21:02,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:02,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:02,199 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash -234570915, now seen corresponding path program 1 times [2019-01-14 19:21:02,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:02,203 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:02,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:02,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:02,395 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:21:02,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:21:02,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:21:02,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:21:02,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:21:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:21:02,400 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 5 states. [2019-01-14 19:21:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:02,457 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-01-14 19:21:02,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:21:02,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 19:21:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:02,465 INFO L225 Difference]: With dead ends: 75 [2019-01-14 19:21:02,465 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 19:21:02,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-14 19:21:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 19:21:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-14 19:21:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 19:21:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-01-14 19:21:02,477 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 16 [2019-01-14 19:21:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:02,477 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-01-14 19:21:02,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:21:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-01-14 19:21:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 19:21:02,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:02,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:02,480 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash -424590341, now seen corresponding path program 1 times [2019-01-14 19:21:02,481 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:02,481 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:02,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:02,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:02,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:21:02,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:21:02,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:21:02,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:21:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:21:02,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:21:02,659 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2019-01-14 19:21:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:02,724 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-01-14 19:21:02,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:21:02,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-14 19:21:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:02,728 INFO L225 Difference]: With dead ends: 75 [2019-01-14 19:21:02,728 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 19:21:02,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-14 19:21:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 19:21:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-14 19:21:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 19:21:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2019-01-14 19:21:02,737 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 17 [2019-01-14 19:21:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:02,737 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2019-01-14 19:21:02,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:21:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2019-01-14 19:21:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 19:21:02,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:02,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:02,741 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1318219994, now seen corresponding path program 1 times [2019-01-14 19:21:02,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:02,742 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:02,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:02,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:02,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 19:21:02,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:21:02,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:21:02,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:21:02,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:21:02,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:21:02,858 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 3 states. [2019-01-14 19:21:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:03,211 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-01-14 19:21:03,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:21:03,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 19:21:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:03,216 INFO L225 Difference]: With dead ends: 111 [2019-01-14 19:21:03,216 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 19:21:03,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:21:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 19:21:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 71. [2019-01-14 19:21:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 19:21:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-01-14 19:21:03,224 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 17 [2019-01-14 19:21:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:03,225 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-01-14 19:21:03,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:21:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-01-14 19:21:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 19:21:03,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:03,227 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:03,228 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 6577339, now seen corresponding path program 1 times [2019-01-14 19:21:03,229 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:03,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:03,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:03,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:03,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:03,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:03,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:21:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:03,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:04,453 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 19:21:05,249 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 19:21:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:05,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:05,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-01-14 19:21:05,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 19:21:05,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 19:21:05,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:21:05,603 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 17 states. [2019-01-14 19:21:07,890 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 19:21:08,755 WARN L181 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 19:21:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:09,392 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2019-01-14 19:21:09,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 19:21:09,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-01-14 19:21:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:09,394 INFO L225 Difference]: With dead ends: 84 [2019-01-14 19:21:09,394 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 19:21:09,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-01-14 19:21:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 19:21:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-01-14 19:21:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 19:21:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-01-14 19:21:09,406 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 19 [2019-01-14 19:21:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:09,407 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-01-14 19:21:09,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 19:21:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-01-14 19:21:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 19:21:09,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:09,409 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:09,410 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1732790627, now seen corresponding path program 2 times [2019-01-14 19:21:09,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:09,414 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:09,431 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-14 19:21:09,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 19:21:09,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:21:09,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:09,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:09,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:09,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:09,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:21:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:09,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:12,060 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 19:21:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:12,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:12,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-01-14 19:21:12,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 19:21:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 19:21:12,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-01-14 19:21:12,515 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 23 states. [2019-01-14 19:21:14,405 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2019-01-14 19:21:14,760 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-01-14 19:21:15,045 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-14 19:21:15,353 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-14 19:21:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:16,540 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2019-01-14 19:21:16,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 19:21:16,541 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2019-01-14 19:21:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:16,542 INFO L225 Difference]: With dead ends: 103 [2019-01-14 19:21:16,543 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 19:21:16,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 19:21:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 19:21:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2019-01-14 19:21:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 19:21:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-01-14 19:21:16,552 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 28 [2019-01-14 19:21:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:16,552 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-01-14 19:21:16,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 19:21:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-01-14 19:21:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 19:21:16,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:16,555 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:16,556 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 785004234, now seen corresponding path program 1 times [2019-01-14 19:21:16,557 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:16,557 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:16,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:21:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:16,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:16,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:17,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:17,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-14 19:21:17,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 19:21:17,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 19:21:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-01-14 19:21:17,094 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 16 states. [2019-01-14 19:21:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:17,836 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-01-14 19:21:17,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 19:21:17,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-01-14 19:21:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:17,840 INFO L225 Difference]: With dead ends: 98 [2019-01-14 19:21:17,840 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 19:21:17,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-14 19:21:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 19:21:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-14 19:21:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 19:21:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2019-01-14 19:21:17,857 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 41 [2019-01-14 19:21:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:17,858 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2019-01-14 19:21:17,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 19:21:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2019-01-14 19:21:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 19:21:17,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:17,860 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:17,861 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:17,861 INFO L82 PathProgramCache]: Analyzing trace with hash -186138531, now seen corresponding path program 3 times [2019-01-14 19:21:17,862 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:17,862 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:17,884 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-14 19:21:18,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-14 19:21:18,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:21:18,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:19,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:21:22,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:22,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2019-01-14 19:21:22,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 19:21:22,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 19:21:22,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1146, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 19:21:22,087 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 38 states. [2019-01-14 19:21:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:24,411 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2019-01-14 19:21:24,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 19:21:24,415 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2019-01-14 19:21:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:24,416 INFO L225 Difference]: With dead ends: 96 [2019-01-14 19:21:24,416 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 19:21:24,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 19:21:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 19:21:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-14 19:21:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 19:21:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-01-14 19:21:24,423 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 46 [2019-01-14 19:21:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:24,423 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-01-14 19:21:24,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 19:21:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-01-14 19:21:24,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 19:21:24,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:24,426 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:24,427 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:24,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:24,428 INFO L82 PathProgramCache]: Analyzing trace with hash 150183532, now seen corresponding path program 2 times [2019-01-14 19:21:24,428 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:24,428 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:24,450 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-14 19:21:24,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 19:21:24,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:21:24,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 19:21:24,584 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:21:24,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:21:24,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:21:24,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:21:24,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:21:24,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:21:24,586 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2019-01-14 19:21:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:24,700 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-01-14 19:21:24,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:21:24,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-01-14 19:21:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:24,703 INFO L225 Difference]: With dead ends: 125 [2019-01-14 19:21:24,705 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 19:21:24,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:21:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 19:21:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2019-01-14 19:21:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 19:21:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-01-14 19:21:24,710 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 56 [2019-01-14 19:21:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:24,710 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-01-14 19:21:24,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:21:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-01-14 19:21:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 19:21:24,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:24,713 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:24,714 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1004910387, now seen corresponding path program 1 times [2019-01-14 19:21:24,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:24,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:24,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:21:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:25,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:25,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:25,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:25,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:25,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:25,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:25,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 19:21:26,934 WARN L860 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2019-01-14 19:21:26,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:27,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:27,015 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 19:21:27,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,037 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 14 treesize of output 17 [2019-01-14 19:21:27,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-01-14 19:21:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2019-01-14 19:21:27,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:27,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:21:27,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:21:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:27,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:27,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:27,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:27,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 19:21:27,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:27,732 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 14 treesize of output 17 [2019-01-14 19:21:27,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:27,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:27,766 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 19:21:27,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:27,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2019-01-14 19:21:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2019-01-14 19:21:27,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:28,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:28,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-14 19:21:28,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:21:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:21:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2019-01-14 19:21:28,063 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 12 states. [2019-01-14 19:21:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:29,858 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2019-01-14 19:21:29,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 19:21:29,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-01-14 19:21:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:29,863 INFO L225 Difference]: With dead ends: 183 [2019-01-14 19:21:29,864 INFO L226 Difference]: Without dead ends: 183 [2019-01-14 19:21:29,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2019-01-14 19:21:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-14 19:21:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 115. [2019-01-14 19:21:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 19:21:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2019-01-14 19:21:29,874 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 56 [2019-01-14 19:21:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:29,874 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2019-01-14 19:21:29,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:21:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2019-01-14 19:21:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 19:21:29,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:29,876 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:29,876 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1004910388, now seen corresponding path program 1 times [2019-01-14 19:21:29,877 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:29,877 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:29,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:30,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:30,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:30,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:30,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:30,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:21:30,705 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|)) is different from true [2019-01-14 19:21:30,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 19:21:30,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:30,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:21:30,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-14 19:21:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2019-01-14 19:21:30,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-14 19:21:31,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:21:31,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2019-01-14 19:21:31,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 19:21:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 19:21:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=51, Unknown=7, NotChecked=14, Total=90 [2019-01-14 19:21:31,219 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand 10 states. [2019-01-14 19:21:32,498 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-01-14 19:21:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:33,450 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2019-01-14 19:21:33,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:21:33,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-01-14 19:21:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:33,454 INFO L225 Difference]: With dead ends: 179 [2019-01-14 19:21:33,454 INFO L226 Difference]: Without dead ends: 179 [2019-01-14 19:21:33,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=44, Invalid=130, Unknown=12, NotChecked=24, Total=210 [2019-01-14 19:21:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-14 19:21:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 99. [2019-01-14 19:21:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 19:21:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-01-14 19:21:33,461 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 56 [2019-01-14 19:21:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:33,461 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-01-14 19:21:33,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 19:21:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-01-14 19:21:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 19:21:33,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:33,463 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:33,464 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash 648714489, now seen corresponding path program 1 times [2019-01-14 19:21:33,465 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:33,465 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:33,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:33,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-14 19:21:33,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:21:33,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:21:33,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:21:33,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:21:33,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:21:33,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:21:33,598 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 5 states. [2019-01-14 19:21:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:33,663 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2019-01-14 19:21:33,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:21:33,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-14 19:21:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:33,665 INFO L225 Difference]: With dead ends: 114 [2019-01-14 19:21:33,665 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 19:21:33,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:21:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 19:21:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2019-01-14 19:21:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 19:21:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-14 19:21:33,672 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 58 [2019-01-14 19:21:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:33,672 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-14 19:21:33,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:21:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-14 19:21:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 19:21:33,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:33,675 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:33,675 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:33,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1903442472, now seen corresponding path program 1 times [2019-01-14 19:21:33,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:33,679 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:33,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:33,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-14 19:21:34,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:21:34,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:21:34,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:21:34,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:21:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:21:34,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:21:34,056 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-01-14 19:21:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:34,179 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2019-01-14 19:21:34,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:21:34,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-14 19:21:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:34,181 INFO L225 Difference]: With dead ends: 109 [2019-01-14 19:21:34,181 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 19:21:34,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:21:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 19:21:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-01-14 19:21:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 19:21:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-01-14 19:21:34,186 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 58 [2019-01-14 19:21:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:34,186 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-01-14 19:21:34,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:21:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-01-14 19:21:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 19:21:34,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:34,189 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:34,190 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1007096494, now seen corresponding path program 1 times [2019-01-14 19:21:34,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:34,190 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:34,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:34,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:34,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:34,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:34,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:34,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:21:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 19:21:34,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:35,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:21:35,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:21:35,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:35,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:35,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:35,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:35,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:35,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:21:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 19:21:35,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:35,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:35,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 19:21:35,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:21:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:21:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=50, Unknown=6, NotChecked=0, Total=72 [2019-01-14 19:21:35,355 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 8 states. [2019-01-14 19:21:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:35,969 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2019-01-14 19:21:35,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:21:35,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-01-14 19:21:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:35,972 INFO L225 Difference]: With dead ends: 155 [2019-01-14 19:21:35,973 INFO L226 Difference]: Without dead ends: 155 [2019-01-14 19:21:35,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=89, Unknown=9, NotChecked=0, Total=132 [2019-01-14 19:21:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-14 19:21:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2019-01-14 19:21:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-14 19:21:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2019-01-14 19:21:35,981 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 65 [2019-01-14 19:21:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:35,981 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2019-01-14 19:21:35,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:21:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2019-01-14 19:21:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 19:21:35,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:35,983 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:35,985 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1007096493, now seen corresponding path program 1 times [2019-01-14 19:21:35,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:35,988 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:36,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:36,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:36,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:36,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:36,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:36,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:21:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 19:21:36,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:36,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:21:36,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:21:36,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:36,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:36,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:36,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:36,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:36,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:21:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 19:21:36,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:37,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:37,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 19:21:37,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 19:21:37,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 19:21:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:21:37,708 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand 10 states. [2019-01-14 19:21:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:38,899 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2019-01-14 19:21:38,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 19:21:38,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-01-14 19:21:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:38,902 INFO L225 Difference]: With dead ends: 175 [2019-01-14 19:21:38,902 INFO L226 Difference]: Without dead ends: 175 [2019-01-14 19:21:38,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-01-14 19:21:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-14 19:21:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2019-01-14 19:21:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-14 19:21:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2019-01-14 19:21:38,913 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 65 [2019-01-14 19:21:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:38,913 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2019-01-14 19:21:38,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 19:21:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2019-01-14 19:21:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 19:21:38,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:38,914 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:38,915 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash -289418062, now seen corresponding path program 1 times [2019-01-14 19:21:38,917 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:38,917 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:38,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:39,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-14 19:21:39,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (21)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 19:21:39,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:39,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-14 19:21:39,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:21:39,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:21:39,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:21:39,382 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand 9 states. [2019-01-14 19:21:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:39,638 INFO L93 Difference]: Finished difference Result 212 states and 259 transitions. [2019-01-14 19:21:39,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:21:39,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-01-14 19:21:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:39,643 INFO L225 Difference]: With dead ends: 212 [2019-01-14 19:21:39,643 INFO L226 Difference]: Without dead ends: 206 [2019-01-14 19:21:39,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:21:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-14 19:21:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 154. [2019-01-14 19:21:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 19:21:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2019-01-14 19:21:39,651 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 66 [2019-01-14 19:21:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:39,652 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2019-01-14 19:21:39,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:21:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2019-01-14 19:21:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 19:21:39,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:39,654 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:39,655 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1444511981, now seen corresponding path program 1 times [2019-01-14 19:21:39,657 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:39,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:39,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:40,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:40,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:40,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:40,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:40,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:40,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:40,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 19:21:41,409 WARN L860 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2019-01-14 19:21:41,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:41,443 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 14 treesize of output 17 [2019-01-14 19:21:41,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:41,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:41,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:41,511 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 19:21:41,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:41,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:41,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-01-14 19:21:41,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:41,616 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 14 treesize of output 17 [2019-01-14 19:21:41,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:41,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:41,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:41,649 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 19:21:41,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:41,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:41,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:16 [2019-01-14 19:21:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 4 not checked. [2019-01-14 19:21:41,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:42,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:21:42,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:21:42,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:42,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:42,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:42,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:42,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 19:21:42,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:42,493 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 14 treesize of output 17 [2019-01-14 19:21:42,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:42,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:42,530 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 19:21:42,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-01-14 19:21:42,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:42,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:42,595 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 19:21:42,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,625 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 14 treesize of output 17 [2019-01-14 19:21:42,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:42,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:16 [2019-01-14 19:21:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 4 not checked. [2019-01-14 19:21:42,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:42,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:42,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-14 19:21:42,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 19:21:42,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 19:21:42,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2019-01-14 19:21:42,959 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand 14 states. [2019-01-14 19:21:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:21:45,442 INFO L93 Difference]: Finished difference Result 236 states and 285 transitions. [2019-01-14 19:21:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 19:21:45,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-01-14 19:21:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:21:45,446 INFO L225 Difference]: With dead ends: 236 [2019-01-14 19:21:45,446 INFO L226 Difference]: Without dead ends: 236 [2019-01-14 19:21:45,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2019-01-14 19:21:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-14 19:21:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 164. [2019-01-14 19:21:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-14 19:21:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2019-01-14 19:21:45,457 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 66 [2019-01-14 19:21:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:21:45,458 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2019-01-14 19:21:45,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 19:21:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2019-01-14 19:21:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 19:21:45,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:21:45,460 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:21:45,462 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:21:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:21:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1155219869, now seen corresponding path program 1 times [2019-01-14 19:21:45,465 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:21:45,465 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:21:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:45,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:45,824 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 15 treesize of output 12 [2019-01-14 19:21:45,828 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 12 treesize of output 11 [2019-01-14 19:21:45,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:45,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:45,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:45,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-14 19:21:45,921 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-14 19:21:45,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:45,927 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 27 [2019-01-14 19:21:45,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:45,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:45,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:45,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 19:21:46,028 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 32 treesize of output 25 [2019-01-14 19:21:46,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2019-01-14 19:21:46,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-14 19:21:46,158 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 41 treesize of output 32 [2019-01-14 19:21:46,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2019-01-14 19:21:46,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-01-14 19:21:46,318 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 50 treesize of output 39 [2019-01-14 19:21:46,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2019-01-14 19:21:46,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-01-14 19:21:46,543 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 59 treesize of output 46 [2019-01-14 19:21:46,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 175 [2019-01-14 19:21:46,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:46,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2019-01-14 19:21:46,855 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 68 treesize of output 53 [2019-01-14 19:21:46,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:46,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 232 [2019-01-14 19:21:46,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:47,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:47,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:47,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-01-14 19:21:47,250 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 77 treesize of output 60 [2019-01-14 19:21:47,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,399 INFO L303 Elim1Store]: Index analysis took 145 ms [2019-01-14 19:21:47,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 297 [2019-01-14 19:21:47,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:47,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:47,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:47,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2019-01-14 19:21:47,796 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 86 treesize of output 67 [2019-01-14 19:21:47,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:47,984 INFO L303 Elim1Store]: Index analysis took 186 ms [2019-01-14 19:21:47,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 370 [2019-01-14 19:21:47,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:48,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:48,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:48,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2019-01-14 19:21:48,530 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 93 treesize of output 72 [2019-01-14 19:21:48,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:48,652 INFO L303 Elim1Store]: Index analysis took 119 ms [2019-01-14 19:21:48,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 431 [2019-01-14 19:21:48,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:48,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:48,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:48,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2019-01-14 19:21:49,264 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 78 treesize of output 56 [2019-01-14 19:21:49,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 3 [2019-01-14 19:21:49,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:49,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:49,277 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-14 19:21:49,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2019-01-14 19:21:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:21:49,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:49,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:21:49,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:21:49,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:21:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:21:50,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:21:50,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:21:50,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:50,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:50,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:21:50,442 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 15 treesize of output 12 [2019-01-14 19:21:50,451 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 12 treesize of output 11 [2019-01-14 19:21:50,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:50,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:50,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:50,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 19:21:50,654 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-14 19:21:50,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:50,660 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 27 [2019-01-14 19:21:50,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:50,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:50,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:50,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-01-14 19:21:50,964 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 5 [2019-01-14 19:21:50,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,001 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 30 treesize of output 23 [2019-01-14 19:21:51,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2019-01-14 19:21:51,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,062 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:29 [2019-01-14 19:21:51,185 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 41 treesize of output 32 [2019-01-14 19:21:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 19:21:51,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:21:51,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-14 19:21:51,379 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 41 treesize of output 32 [2019-01-14 19:21:51,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 19:21:51,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:21:51,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-14 19:21:51,586 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 41 treesize of output 32 [2019-01-14 19:21:51,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 19:21:51,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:21:51,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-14 19:21:51,778 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 41 treesize of output 32 [2019-01-14 19:21:51,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 19:21:51,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:51,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:21:51,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-14 19:21:51,978 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 41 treesize of output 32 [2019-01-14 19:21:51,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:51,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:52,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 19:21:52,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:52,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:52,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:21:52,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-14 19:21:52,184 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 41 treesize of output 32 [2019-01-14 19:21:52,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:52,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:52,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:52,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 19:21:52,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:52,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:52,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:21:52,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-14 19:21:52,393 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 41 treesize of output 32 [2019-01-14 19:21:52,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:52,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:52,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:21:52,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 19:21:52,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:52,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:52,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:21:52,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-14 19:21:52,765 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 29 treesize of output 21 [2019-01-14 19:21:52,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2019-01-14 19:21:52,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:21:52,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:21:52,773 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-14 19:21:52,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2019-01-14 19:21:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-14 19:21:52,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:21:52,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:21:52,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 41 [2019-01-14 19:21:52,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 19:21:52,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 19:21:52,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 19:21:52,935 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand 42 states. [2019-01-14 19:22:01,231 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 19:22:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:22:02,702 INFO L93 Difference]: Finished difference Result 195 states and 234 transitions. [2019-01-14 19:22:02,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-14 19:22:02,704 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2019-01-14 19:22:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:22:02,706 INFO L225 Difference]: With dead ends: 195 [2019-01-14 19:22:02,706 INFO L226 Difference]: Without dead ends: 195 [2019-01-14 19:22:02,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=507, Invalid=5813, Unknown=0, NotChecked=0, Total=6320 [2019-01-14 19:22:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-14 19:22:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2019-01-14 19:22:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-14 19:22:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2019-01-14 19:22:02,717 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 66 [2019-01-14 19:22:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:22:02,718 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2019-01-14 19:22:02,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 19:22:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2019-01-14 19:22:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 19:22:02,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:22:02,721 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:22:02,722 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:22:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:22:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1452077134, now seen corresponding path program 1 times [2019-01-14 19:22:02,722 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:22:02,722 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 19:22:02,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:22:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 19:22:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 19:22:04,506 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 19:22:04,576 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-14 19:22:04,580 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-14 19:22:04,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:22:04 BoogieIcfgContainer [2019-01-14 19:22:04,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:22:04,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:22:04,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:22:04,623 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:22:04,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:21:00" (3/4) ... [2019-01-14 19:22:04,630 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 19:22:04,646 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-14 19:22:04,646 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-01-14 19:22:04,777 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 19:22:04,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:22:04,785 INFO L168 Benchmark]: Toolchain (without parser) took 68736.37 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 947.3 MB in the beginning and 948.8 MB in the end (delta: -1.4 MB). Peak memory consumption was 400.7 MB. Max. memory is 11.5 GB. [2019-01-14 19:22:04,786 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:22:04,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-01-14 19:22:04,787 INFO L168 Benchmark]: Boogie Preprocessor took 153.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:22:04,787 INFO L168 Benchmark]: RCFGBuilder took 3050.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.7 MB in the end (delta: 126.6 MB). Peak memory consumption was 126.6 MB. Max. memory is 11.5 GB. [2019-01-14 19:22:04,788 INFO L168 Benchmark]: TraceAbstraction took 64549.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 978.7 MB in the beginning and 960.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. [2019-01-14 19:22:04,788 INFO L168 Benchmark]: Witness Printer took 160.53 ms. Allocated memory is still 1.4 GB. Free memory was 960.0 MB in the beginning and 948.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2019-01-14 19:22:04,796 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 814.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 153.67 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 3050.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.7 MB in the end (delta: 126.6 MB). Peak memory consumption was 126.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64549.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 978.7 MB in the beginning and 960.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. * Witness Printer took 160.53 ms. Allocated memory is still 1.4 GB. Free memory was 960.0 MB in the beginning and 948.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 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: 1460]: 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={-65535:0}] [L1478] CALL entry_point() VAL [ldv_global_msg_list={-65535:0}] [L1465] int i; [L1466] int len = 10; VAL [ldv_global_msg_list={-65535:0}, len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40, ldv_global_msg_list={-65535:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=40, \result={2147356680:0}, ldv_global_msg_list={-65535:0}, malloc(size)={2147356680:0}, size=40] [L1467] RET, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_global_msg_list={-65535:0}, ldv_malloc(sizeof(struct A17*)*len)={2147356680:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND FALSE !(!array) [L1469] i=0 VAL [array={2147356680:0}, i=0, ldv_global_msg_list={-65535:0}, len=10] [L1469] COND TRUE i=0) VAL [\old(len)=10, array={2147356680:0}, array={2147356680:0}, i=0, j=4294967295, ldv_global_msg_list={-65535:0}, len=10, p={0:0}] [L1454] return - -3; VAL [\old(len)=10, \result=3, array={2147356680:0}, array={2147356680:0}, i=0, j=4294967295, ldv_global_msg_list={-65535:0}, len=10, p={0:0}] [L1472] RET alloc_17(array, len) VAL [alloc_17(array, len)=3, array={2147356680:0}, i=10, ldv_global_msg_list={-65535:0}, len=10] [L1473] CALL free_17(array, len) VAL [\old(len)=10, array={2147356680:0}, ldv_global_msg_list={-65535:0}] [L1458] int i; [L1459] i=0 VAL [\old(len)=10, array={2147356680:0}, array={2147356680:0}, i=0, ldv_global_msg_list={-65535:0}, len=10] [L1459] COND TRUE i