./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 855ef959a267a6e57a6a3e6d7925f66e84a760d6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 855ef959a267a6e57a6a3e6d7925f66e84a760d6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:32:44,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:32:44,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:32:44,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:32:44,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:32:44,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:32:44,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:32:44,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:32:44,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:32:44,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:32:44,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:32:44,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:32:44,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:32:44,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:32:44,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:32:44,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:32:44,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:32:44,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:32:44,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:32:44,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:32:44,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:32:44,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:32:44,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:32:44,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:32:44,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:32:44,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:32:44,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:32:44,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:32:44,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:32:44,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:32:44,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:32:44,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:32:44,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:32:44,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:32:44,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:32:44,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:32:44,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:32:44,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:32:44,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:32:44,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:32:44,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:32:44,251 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 20:32:44,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:32:44,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:32:44,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:32:44,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:32:44,280 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:32:44,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:32:44,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:32:44,281 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:32:44,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:32:44,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:32:44,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:32:44,282 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 20:32:44,282 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 20:32:44,282 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 20:32:44,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:32:44,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:32:44,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:32:44,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:32:44,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:32:44,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:32:44,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:32:44,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:32:44,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:32:44,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:32:44,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:32:44,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:32:44,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 855ef959a267a6e57a6a3e6d7925f66e84a760d6 [2019-11-15 20:32:44,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:32:44,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:32:44,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:32:44,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:32:44,335 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:32:44,336 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2019-11-15 20:32:44,420 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data/4edeb2152/987aa334978449a5a0829a47135e958a/FLAGf3b46a1d8 [2019-11-15 20:32:44,946 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:32:44,952 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2019-11-15 20:32:44,970 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data/4edeb2152/987aa334978449a5a0829a47135e958a/FLAGf3b46a1d8 [2019-11-15 20:32:45,157 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data/4edeb2152/987aa334978449a5a0829a47135e958a [2019-11-15 20:32:45,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:32:45,161 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 20:32:45,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:32:45,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:32:45,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:32:45,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:45,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f90b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45, skipping insertion in model container [2019-11-15 20:32:45,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:45,180 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:32:45,228 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:32:45,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:32:45,734 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:32:45,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:32:45,893 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:32:45,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45 WrapperNode [2019-11-15 20:32:45,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:32:45,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:32:45,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:32:45,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:32:45,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:45,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:45,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:45,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:45,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:45,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:45,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (1/1) ... [2019-11-15 20:32:46,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:32:46,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:32:46,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:32:46,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:32:46,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:32:46,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 20:32:46,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:32:46,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-15 20:32:46,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 20:32:46,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 20:32:46,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 20:32:46,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 20:32:46,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 20:32:46,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-15 20:32:46,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-15 20:32:46,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-15 20:32:46,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-15 20:32:46,091 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-15 20:32:46,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-15 20:32:46,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-15 20:32:46,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-15 20:32:46,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-15 20:32:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-15 20:32:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-15 20:32:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-15 20:32:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-15 20:32:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-15 20:32:46,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-15 20:32:46,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-15 20:32:46,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-15 20:32:46,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-15 20:32:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-15 20:32:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-15 20:32:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-15 20:32:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-15 20:32:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-15 20:32:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-15 20:32:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-15 20:32:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-15 20:32:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-15 20:32:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-15 20:32:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-15 20:32:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-15 20:32:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-15 20:32:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-15 20:32:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-15 20:32:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-15 20:32:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 20:32:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-15 20:32:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-15 20:32:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-15 20:32:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 20:32:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 20:32:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 20:32:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 20:32:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 20:32:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 20:32:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 20:32:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 20:32:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 20:32:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 20:32:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 20:32:46,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 20:32:46,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 20:32:46,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 20:32:46,100 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 20:32:46,100 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 20:32:46,101 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 20:32:46,101 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 20:32:46,101 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 20:32:46,101 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 20:32:46,101 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 20:32:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 20:32:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 20:32:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 20:32:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 20:32:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 20:32:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 20:32:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 20:32:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 20:32:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 20:32:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 20:32:46,104 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 20:32:46,104 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 20:32:46,104 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 20:32:46,104 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 20:32:46,104 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 20:32:46,105 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 20:32:46,105 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 20:32:46,105 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 20:32:46,105 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 20:32:46,105 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 20:32:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 20:32:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 20:32:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 20:32:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 20:32:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 20:32:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 20:32:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 20:32:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 20:32:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 20:32:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 20:32:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 20:32:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 20:32:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 20:32:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 20:32:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 20:32:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 20:32:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 20:32:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 20:32:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 20:32:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 20:32:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 20:32:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 20:32:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 20:32:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 20:32:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 20:32:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 20:32:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 20:32:46,111 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 20:32:46,111 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 20:32:46,111 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 20:32:46,111 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 20:32:46,111 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 20:32:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 20:32:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 20:32:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 20:32:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 20:32:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 20:32:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 20:32:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 20:32:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 20:32:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 20:32:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 20:32:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 20:32:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 20:32:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 20:32:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 20:32:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 20:32:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 20:32:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 20:32:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 20:32:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 20:32:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 20:32:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 20:32:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 20:32:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 20:32:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 20:32:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 20:32:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 20:32:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 20:32:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 20:32:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 20:32:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 20:32:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 20:32:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 20:32:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 20:32:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 20:32:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-15 20:32:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 20:32:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-15 20:32:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-15 20:32:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-15 20:32:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-15 20:32:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-15 20:32:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-15 20:32:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:32:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-15 20:32:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-15 20:32:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-15 20:32:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:32:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-15 20:32:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-15 20:32:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-15 20:32:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:32:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-15 20:32:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-15 20:32:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-15 20:32:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-15 20:32:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-15 20:32:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-15 20:32:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:32:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-15 20:32:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-15 20:32:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-15 20:32:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-15 20:32:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-15 20:32:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:32:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:32:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-15 20:32:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-15 20:32:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-15 20:32:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-15 20:32:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-15 20:32:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-15 20:32:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-15 20:32:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-15 20:32:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-15 20:32:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-15 20:32:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-15 20:32:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-15 20:32:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-15 20:32:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-15 20:32:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-15 20:32:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-15 20:32:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-15 20:32:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-15 20:32:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 20:32:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 20:32:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:32:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 20:32:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:32:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-15 20:32:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-15 20:32:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-15 20:32:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-15 20:32:46,837 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:32:47,078 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:32:47,376 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:32:47,378 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-15 20:32:47,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:32:47 BoogieIcfgContainer [2019-11-15 20:32:47,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:32:47,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:32:47,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:32:47,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:32:47,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:32:45" (1/3) ... [2019-11-15 20:32:47,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce40c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:32:47, skipping insertion in model container [2019-11-15 20:32:47,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:45" (2/3) ... [2019-11-15 20:32:47,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce40c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:32:47, skipping insertion in model container [2019-11-15 20:32:47,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:32:47" (3/3) ... [2019-11-15 20:32:47,394 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3.i [2019-11-15 20:32:47,405 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:32:47,417 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2019-11-15 20:32:47,429 INFO L249 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2019-11-15 20:32:47,453 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:32:47,453 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 20:32:47,453 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:32:47,454 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:32:47,454 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:32:47,454 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:32:47,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:32:47,454 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:32:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-11-15 20:32:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:32:47,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:47,496 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:47,498 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash -726484693, now seen corresponding path program 1 times [2019-11-15 20:32:47,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:47,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059819873] [2019-11-15 20:32:47,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:47,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:47,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:47,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059819873] [2019-11-15 20:32:47,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:32:47,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:32:47,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708703513] [2019-11-15 20:32:47,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:32:47,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:32:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:32:48,014 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 8 states. [2019-11-15 20:32:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:48,475 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2019-11-15 20:32:48,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:32:48,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-15 20:32:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:48,492 INFO L225 Difference]: With dead ends: 62 [2019-11-15 20:32:48,493 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 20:32:48,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:32:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 20:32:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-11-15 20:32:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 20:32:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-11-15 20:32:48,583 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2019-11-15 20:32:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:48,585 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-15 20:32:48,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:32:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-11-15 20:32:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:32:48,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:48,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:48,592 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:48,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:48,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1045689427, now seen corresponding path program 1 times [2019-11-15 20:32:48,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:48,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647844365] [2019-11-15 20:32:48,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:48,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:48,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:48,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647844365] [2019-11-15 20:32:48,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:32:48,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:32:48,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298049499] [2019-11-15 20:32:48,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:32:48,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:48,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:32:48,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:32:48,825 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 7 states. [2019-11-15 20:32:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:49,303 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-11-15 20:32:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:32:49,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-15 20:32:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:49,306 INFO L225 Difference]: With dead ends: 50 [2019-11-15 20:32:49,306 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 20:32:49,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:32:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 20:32:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-11-15 20:32:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 20:32:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-15 20:32:49,322 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2019-11-15 20:32:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:49,322 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-15 20:32:49,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:32:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-11-15 20:32:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:32:49,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:49,325 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:49,326 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:49,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:49,326 INFO L82 PathProgramCache]: Analyzing trace with hash 182602424, now seen corresponding path program 1 times [2019-11-15 20:32:49,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:49,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450769307] [2019-11-15 20:32:49,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:49,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:49,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:32:49,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450769307] [2019-11-15 20:32:49,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608392712] [2019-11-15 20:32:49,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:49,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 20:32:49,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:50,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:32:50,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:50,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:50,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:50,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-15 20:32:50,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:50,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 20:32:50,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:50,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:50,339 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-15 20:32:50,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:50,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:32:50,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:21 [2019-11-15 20:32:50,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:50,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:50,439 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:32:50,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-15 20:32:50,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511865137] [2019-11-15 20:32:50,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:32:50,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:50,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:32:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:32:50,441 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 18 states. [2019-11-15 20:32:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:51,696 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-15 20:32:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:32:51,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-15 20:32:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:51,699 INFO L225 Difference]: With dead ends: 60 [2019-11-15 20:32:51,699 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 20:32:51,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2019-11-15 20:32:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 20:32:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2019-11-15 20:32:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 20:32:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-11-15 20:32:51,720 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 22 [2019-11-15 20:32:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:51,722 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-11-15 20:32:51,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:32:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-11-15 20:32:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:32:51,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:51,729 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:51,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:51,939 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash 182602423, now seen corresponding path program 1 times [2019-11-15 20:32:51,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:51,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425246159] [2019-11-15 20:32:51,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:51,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:51,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:32:52,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425246159] [2019-11-15 20:32:52,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930875775] [2019-11-15 20:32:52,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:52,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 20:32:52,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:52,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:32:52,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:52,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:52,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:52,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 20:32:52,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:52,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 20:32:52,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:52,396 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 20:32:52,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:32:52,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-15 20:32:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:52,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:32:52,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 20:32:52,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190781735] [2019-11-15 20:32:52,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:32:52,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:32:52,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:32:52,405 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 10 states. [2019-11-15 20:32:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:52,911 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2019-11-15 20:32:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:32:52,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-15 20:32:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:52,912 INFO L225 Difference]: With dead ends: 68 [2019-11-15 20:32:52,912 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:32:52,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:32:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:32:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2019-11-15 20:32:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 20:32:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-15 20:32:52,925 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 22 [2019-11-15 20:32:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:52,925 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-15 20:32:52,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:32:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-15 20:32:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:32:52,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:52,927 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:53,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:53,128 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash -110800583, now seen corresponding path program 1 times [2019-11-15 20:32:53,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:53,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184339280] [2019-11-15 20:32:53,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:53,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:53,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:32:53,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184339280] [2019-11-15 20:32:53,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075993102] [2019-11-15 20:32:53,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 20:32:53,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:53,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:32:53,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2019-11-15 20:32:53,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695278685] [2019-11-15 20:32:53,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:32:53,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:53,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:32:53,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:32:53,491 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 5 states. [2019-11-15 20:32:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:53,515 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-15 20:32:53,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:32:53,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 20:32:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:53,516 INFO L225 Difference]: With dead ends: 40 [2019-11-15 20:32:53,517 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 20:32:53,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:32:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 20:32:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 20:32:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 20:32:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-15 20:32:53,522 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-11-15 20:32:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:53,523 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-15 20:32:53,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:32:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-15 20:32:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 20:32:53,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:53,524 INFO L380 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] [2019-11-15 20:32:53,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:53,728 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 61652203, now seen corresponding path program 1 times [2019-11-15 20:32:53,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:53,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112377035] [2019-11-15 20:32:53,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:53,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:53,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 20:32:53,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112377035] [2019-11-15 20:32:53,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330343285] [2019-11-15 20:32:53,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:54,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:54,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 20:32:54,221 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:32:54,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-15 20:32:54,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809523308] [2019-11-15 20:32:54,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:32:54,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:32:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:32:54,223 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 10 states. [2019-11-15 20:32:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:54,491 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-11-15 20:32:54,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:32:54,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-15 20:32:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:54,493 INFO L225 Difference]: With dead ends: 43 [2019-11-15 20:32:54,493 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 20:32:54,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:32:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 20:32:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2019-11-15 20:32:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 20:32:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-15 20:32:54,509 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 27 [2019-11-15 20:32:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:54,510 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-15 20:32:54,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:32:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-15 20:32:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 20:32:54,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:54,512 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:54,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:54,724 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:54,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash 244067574, now seen corresponding path program 1 times [2019-11-15 20:32:54,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:54,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288141351] [2019-11-15 20:32:54,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:54,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:54,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:32:55,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288141351] [2019-11-15 20:32:55,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57937889] [2019-11-15 20:32:55,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:55,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 20:32:55,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:55,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:32:55,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:55,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:32:55,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:55,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,332 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 20:32:55,412 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:55,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:32:55,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:55,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:32:55,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:55,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:32:55,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:32:55,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:32:55,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:55,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:55,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:32:55,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:55,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:55,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:32:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 20:32:55,582 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:32:55,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-11-15 20:32:55,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615176080] [2019-11-15 20:32:55,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:32:55,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:32:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:32:55,586 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 18 states. [2019-11-15 20:32:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:56,338 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2019-11-15 20:32:56,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:32:56,339 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-11-15 20:32:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:56,340 INFO L225 Difference]: With dead ends: 62 [2019-11-15 20:32:56,340 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 20:32:56,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2019-11-15 20:32:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 20:32:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2019-11-15 20:32:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:32:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-11-15 20:32:56,348 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 31 [2019-11-15 20:32:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:56,349 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-11-15 20:32:56,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:32:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-11-15 20:32:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 20:32:56,350 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:56,350 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:56,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:56,551 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash -223571603, now seen corresponding path program 2 times [2019-11-15 20:32:56,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:56,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690691333] [2019-11-15 20:32:56,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:56,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:56,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 20:32:56,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690691333] [2019-11-15 20:32:56,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696594295] [2019-11-15 20:32:56,767 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:56,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:32:56,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:32:56,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:32:56,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 20:32:57,016 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:32:57,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-11-15 20:32:57,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611869341] [2019-11-15 20:32:57,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:32:57,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:32:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:32:57,018 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 12 states. [2019-11-15 20:32:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:57,194 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-11-15 20:32:57,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:32:57,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-15 20:32:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:57,195 INFO L225 Difference]: With dead ends: 48 [2019-11-15 20:32:57,195 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 20:32:57,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:32:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 20:32:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-11-15 20:32:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 20:32:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-11-15 20:32:57,201 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 36 [2019-11-15 20:32:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:57,202 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-11-15 20:32:57,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:32:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-11-15 20:32:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 20:32:57,203 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:57,204 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:57,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:57,405 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 413790328, now seen corresponding path program 2 times [2019-11-15 20:32:57,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:57,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348384901] [2019-11-15 20:32:57,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:57,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:57,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 20:32:57,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348384901] [2019-11-15 20:32:57,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293789041] [2019-11-15 20:32:57,824 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:58,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:32:58,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:32:58,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 20:32:58,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:58,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:32:58,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:32:58,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 20:32:58,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:32:58,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:32:58,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:32:58,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:32:58,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:32:58,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:32:58,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:32:58,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,327 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:32:58,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:32:58,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:32:58,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:32:58,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:58,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:58,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:32:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 20:32:58,507 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:32:58,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2019-11-15 20:32:58,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758178685] [2019-11-15 20:32:58,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 20:32:58,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 20:32:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:32:58,509 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 22 states. [2019-11-15 20:32:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:59,548 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-11-15 20:32:59,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:32:59,549 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-11-15 20:32:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:59,551 INFO L225 Difference]: With dead ends: 74 [2019-11-15 20:32:59,551 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 20:32:59,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 20:32:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 20:32:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 46. [2019-11-15 20:32:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 20:32:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-11-15 20:32:59,559 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 40 [2019-11-15 20:32:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:59,559 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-11-15 20:32:59,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 20:32:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-11-15 20:32:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:32:59,561 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:59,562 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:59,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:59,770 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:32:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:59,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1367781163, now seen corresponding path program 3 times [2019-11-15 20:32:59,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:59,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931143947] [2019-11-15 20:32:59,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:59,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:59,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 20:32:59,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931143947] [2019-11-15 20:32:59,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890621580] [2019-11-15 20:32:59,984 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:00,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 20:33:00,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:00,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:33:00,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 20:33:00,283 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:00,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-11-15 20:33:00,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860198151] [2019-11-15 20:33:00,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:33:00,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:33:00,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:33:00,287 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 14 states. [2019-11-15 20:33:00,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:00,519 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2019-11-15 20:33:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:33:00,520 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-11-15 20:33:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:00,521 INFO L225 Difference]: With dead ends: 53 [2019-11-15 20:33:00,521 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 20:33:00,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:33:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 20:33:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-11-15 20:33:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 20:33:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-11-15 20:33:00,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 45 [2019-11-15 20:33:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:00,535 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-11-15 20:33:00,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:33:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-11-15 20:33:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 20:33:00,540 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:00,540 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:00,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:00,746 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash 497221430, now seen corresponding path program 3 times [2019-11-15 20:33:00,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:00,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149444336] [2019-11-15 20:33:00,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:00,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:00,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 20:33:01,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149444336] [2019-11-15 20:33:01,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887149122] [2019-11-15 20:33:01,263 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:01,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 20:33:01,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:01,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 20:33:01,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:01,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:01,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:01,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,533 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 20:33:01,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:01,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:01,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-11-15 20:33:01,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:01,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:01,883 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:01,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-11-15 20:33:01,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:01,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:01,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:02,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:02,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:02,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:02,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:02,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:02,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-11-15 20:33:02,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:02,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:02,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:02,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:02,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:02,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:02,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:02,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:02,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:02,213 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:21 [2019-11-15 20:33:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 20:33:02,277 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:02,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2019-11-15 20:33:02,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022642081] [2019-11-15 20:33:02,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 20:33:02,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:02,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 20:33:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2019-11-15 20:33:02,279 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 30 states. [2019-11-15 20:33:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:04,695 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2019-11-15 20:33:04,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 20:33:04,696 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 49 [2019-11-15 20:33:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:04,697 INFO L225 Difference]: With dead ends: 86 [2019-11-15 20:33:04,697 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 20:33:04,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=258, Invalid=1904, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 20:33:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 20:33:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 51. [2019-11-15 20:33:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 20:33:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-11-15 20:33:04,704 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 49 [2019-11-15 20:33:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:04,705 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-11-15 20:33:04,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 20:33:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-11-15 20:33:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 20:33:04,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:04,708 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:04,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:04,913 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:04,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1472256211, now seen corresponding path program 4 times [2019-11-15 20:33:04,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:04,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305761731] [2019-11-15 20:33:04,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:04,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:04,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 20:33:05,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305761731] [2019-11-15 20:33:05,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161375364] [2019-11-15 20:33:05,165 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:05,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:33:05,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:05,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:33:05,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 20:33:05,466 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:05,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-11-15 20:33:05,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000057397] [2019-11-15 20:33:05,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:33:05,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:33:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:33:05,468 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 16 states. [2019-11-15 20:33:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:05,704 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2019-11-15 20:33:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:33:05,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-11-15 20:33:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:05,706 INFO L225 Difference]: With dead ends: 58 [2019-11-15 20:33:05,706 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 20:33:05,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:33:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 20:33:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2019-11-15 20:33:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 20:33:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-11-15 20:33:05,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 54 [2019-11-15 20:33:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:05,712 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-11-15 20:33:05,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:33:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-11-15 20:33:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 20:33:05,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:05,714 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:05,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:05,919 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:05,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash -210000328, now seen corresponding path program 4 times [2019-11-15 20:33:05,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:05,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551569498] [2019-11-15 20:33:05,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:05,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:05,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 20:33:06,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551569498] [2019-11-15 20:33:06,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921149371] [2019-11-15 20:33:06,469 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:06,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:33:06,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:06,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 20:33:06,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:06,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:06,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:06,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:06,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:06,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:06,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:06,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:06,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 20:33:06,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:06,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:06,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:06,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:07,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:07,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:07,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-11-15 20:33:07,195 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_24|], 3=[|v_old(#valid)_AFTER_CALL_50|]} [2019-11-15 20:33:07,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:07,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:07,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:07,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 20:33:07,250 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:07,299 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-15 20:33:07,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:33:07,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2019-11-15 20:33:07,463 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_26|], 6=[|v_old(#valid)_AFTER_CALL_51|]} [2019-11-15 20:33:07,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:07,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:07,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:07,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,552 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 20:33:07,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:07,659 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-11-15 20:33:07,660 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.1 percent of original size [2019-11-15 20:33:07,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 20:33:07,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:39 [2019-11-15 20:33:07,847 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_28|], 10=[|v_old(#valid)_AFTER_CALL_52|]} [2019-11-15 20:33:07,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:07,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:07,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:07,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:07,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-11-15 20:33:07,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:08,049 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-15 20:33:08,050 INFO L567 ElimStorePlain]: treesize reduction 42, result has 59.2 percent of original size [2019-11-15 20:33:08,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 20:33:08,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:56, output treesize:56 [2019-11-15 20:33:08,242 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#length)_AFTER_CALL_53|], 10=[|v_#valid_BEFORE_CALL_30|]} [2019-11-15 20:33:08,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:08,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:08,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:08,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:08,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:08,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 48 [2019-11-15 20:33:08,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:08,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:08,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:08,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:67, output treesize:12 [2019-11-15 20:33:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 67 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 20:33:08,448 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:08,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2019-11-15 20:33:08,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727678301] [2019-11-15 20:33:08,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 20:33:08,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 20:33:08,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 20:33:08,451 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 34 states. [2019-11-15 20:33:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:10,768 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2019-11-15 20:33:10,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 20:33:10,768 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 58 [2019-11-15 20:33:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:10,775 INFO L225 Difference]: With dead ends: 119 [2019-11-15 20:33:10,775 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 20:33:10,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=276, Invalid=2804, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 20:33:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 20:33:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 56. [2019-11-15 20:33:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 20:33:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2019-11-15 20:33:10,785 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 58 [2019-11-15 20:33:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:10,786 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-11-15 20:33:10,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 20:33:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2019-11-15 20:33:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 20:33:10,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:10,788 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:10,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:10,996 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1239379605, now seen corresponding path program 5 times [2019-11-15 20:33:10,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:10,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476178114] [2019-11-15 20:33:10,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:10,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:10,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 20:33:11,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476178114] [2019-11-15 20:33:11,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737598357] [2019-11-15 20:33:11,229 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:11,529 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 20:33:11,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:11,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:33:11,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 20:33:11,670 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:11,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-11-15 20:33:11,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327369907] [2019-11-15 20:33:11,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:33:11,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:11,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:33:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:33:11,672 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 18 states. [2019-11-15 20:33:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:12,051 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-11-15 20:33:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:33:12,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2019-11-15 20:33:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:12,053 INFO L225 Difference]: With dead ends: 63 [2019-11-15 20:33:12,054 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 20:33:12,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:33:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 20:33:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2019-11-15 20:33:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 20:33:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-11-15 20:33:12,104 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 63 [2019-11-15 20:33:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:12,105 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-11-15 20:33:12,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:33:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-11-15 20:33:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:33:12,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:12,109 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:12,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:12,322 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash 33669494, now seen corresponding path program 5 times [2019-11-15 20:33:12,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:12,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854565216] [2019-11-15 20:33:12,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:12,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:12,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 20:33:13,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854565216] [2019-11-15 20:33:13,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058635402] [2019-11-15 20:33:13,037 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:13,308 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-15 20:33:13,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:13,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 84 conjunts are in the unsatisfiable core [2019-11-15 20:33:13,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:13,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:13,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:13,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 20:33:13,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:13,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:13,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:13,475 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,497 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:13,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:13,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:13,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:13,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:13,688 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:13,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:13,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:13,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:13,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:13,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:13,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,849 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:13,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:13,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:13,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:13,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:13,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:13,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:14,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:14,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:14,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:14,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:14,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:14,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:14,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:14,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:14,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:14,084 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 88 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 20:33:14,130 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:14,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2019-11-15 20:33:14,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729994598] [2019-11-15 20:33:14,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 20:33:14,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 20:33:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 20:33:14,132 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 34 states. [2019-11-15 20:33:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:16,425 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2019-11-15 20:33:16,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 20:33:16,426 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-11-15 20:33:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:16,427 INFO L225 Difference]: With dead ends: 110 [2019-11-15 20:33:16,427 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 20:33:16,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=275, Invalid=2917, Unknown=0, NotChecked=0, Total=3192 [2019-11-15 20:33:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 20:33:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 61. [2019-11-15 20:33:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 20:33:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-11-15 20:33:16,436 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 67 [2019-11-15 20:33:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:16,437 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-11-15 20:33:16,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 20:33:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-11-15 20:33:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:33:16,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:16,439 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:16,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:16,644 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1207946477, now seen corresponding path program 6 times [2019-11-15 20:33:16,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:16,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706847821] [2019-11-15 20:33:16,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:16,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:16,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 20:33:16,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706847821] [2019-11-15 20:33:16,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473645690] [2019-11-15 20:33:16,960 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:17,388 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-15 20:33:17,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:17,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:33:17,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 20:33:17,519 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:17,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2019-11-15 20:33:17,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66893308] [2019-11-15 20:33:17,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 20:33:17,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:17,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 20:33:17,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:33:17,520 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 20 states. [2019-11-15 20:33:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:17,794 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-11-15 20:33:17,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:33:17,794 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-11-15 20:33:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:17,795 INFO L225 Difference]: With dead ends: 68 [2019-11-15 20:33:17,795 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:33:17,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:33:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:33:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-11-15 20:33:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 20:33:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-11-15 20:33:17,801 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 72 [2019-11-15 20:33:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:17,801 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-11-15 20:33:17,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 20:33:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-11-15 20:33:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:33:17,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:17,803 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:18,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:18,009 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:18,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:18,009 INFO L82 PathProgramCache]: Analyzing trace with hash -755799048, now seen corresponding path program 6 times [2019-11-15 20:33:18,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:18,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920252339] [2019-11-15 20:33:18,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:18,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:18,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-15 20:33:18,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920252339] [2019-11-15 20:33:18,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873755462] [2019-11-15 20:33:18,813 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:19,163 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 20:33:19,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:19,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 86 conjunts are in the unsatisfiable core [2019-11-15 20:33:19,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:19,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:19,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:19,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:19,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:19,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-15 20:33:19,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:19,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-15 20:33:19,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:19,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:19,595 INFO L567 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2019-11-15 20:33:19,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:19,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:33:19,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:23 [2019-11-15 20:33:19,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:19,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:19,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:20,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:20,073 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_44|], 3=[|v_#length_BEFORE_CALL_46|]} [2019-11-15 20:33:20,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-15 20:33:20,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2019-11-15 20:33:20,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-11-15 20:33:20,171 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 63 [2019-11-15 20:33:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:20,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:20,200 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,316 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-11-15 20:33:20,316 INFO L567 ElimStorePlain]: treesize reduction 34, result has 66.7 percent of original size [2019-11-15 20:33:20,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:20,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:33:20,317 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:78, output treesize:41 [2019-11-15 20:33:20,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:20,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:20,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,569 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:20,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:21 [2019-11-15 20:33:20,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:20,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:20,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,724 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:20,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:21 [2019-11-15 20:33:20,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:20,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:20,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,904 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:20,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:20,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:20,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:21 [2019-11-15 20:33:21,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:21,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:21,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:21,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:21,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:21,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:21,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:21,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:21,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:21,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:21 [2019-11-15 20:33:21,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:21,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:33:21,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:21,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:21,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:21,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:21,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:21,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:21,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:21,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:28 [2019-11-15 20:33:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 13 proven. 138 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 20:33:21,510 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:21,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 46 [2019-11-15 20:33:21,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466824212] [2019-11-15 20:33:21,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 20:33:21,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 20:33:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1996, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 20:33:21,513 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 47 states. [2019-11-15 20:33:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:26,494 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-11-15 20:33:26,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 20:33:26,494 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 76 [2019-11-15 20:33:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:26,496 INFO L225 Difference]: With dead ends: 127 [2019-11-15 20:33:26,496 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 20:33:26,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=525, Invalid=5175, Unknown=0, NotChecked=0, Total=5700 [2019-11-15 20:33:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 20:33:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 75. [2019-11-15 20:33:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 20:33:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2019-11-15 20:33:26,504 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 76 [2019-11-15 20:33:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:26,504 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2019-11-15 20:33:26,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 20:33:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2019-11-15 20:33:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 20:33:26,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:26,507 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:26,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:26,712 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1532912555, now seen corresponding path program 7 times [2019-11-15 20:33:26,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:26,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121780238] [2019-11-15 20:33:26,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:26,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:26,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-15 20:33:26,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121780238] [2019-11-15 20:33:26,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970721135] [2019-11-15 20:33:26,989 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:27,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:33:27,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-15 20:33:27,361 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:27,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-11-15 20:33:27,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250965865] [2019-11-15 20:33:27,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 20:33:27,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 20:33:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:33:27,362 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand 22 states. [2019-11-15 20:33:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:27,686 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2019-11-15 20:33:27,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:33:27,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2019-11-15 20:33:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:27,687 INFO L225 Difference]: With dead ends: 82 [2019-11-15 20:33:27,687 INFO L226 Difference]: Without dead ends: 82 [2019-11-15 20:33:27,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2019-11-15 20:33:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-15 20:33:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2019-11-15 20:33:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 20:33:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2019-11-15 20:33:27,694 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 81 [2019-11-15 20:33:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:27,696 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2019-11-15 20:33:27,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 20:33:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2019-11-15 20:33:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 20:33:27,698 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:27,698 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:27,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:27,903 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1401713590, now seen corresponding path program 7 times [2019-11-15 20:33:27,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:27,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113140657] [2019-11-15 20:33:27,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:27,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:27,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-15 20:33:28,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113140657] [2019-11-15 20:33:28,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653716118] [2019-11-15 20:33:28,745 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:28,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 107 conjunts are in the unsatisfiable core [2019-11-15 20:33:28,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:29,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:29,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:29,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 20:33:29,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:29,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:29,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:29,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,161 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:29,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:29,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:29,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:29,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:29,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:29,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:29,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:29,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:29,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:29,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:29,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,465 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:29,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:29,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:29,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:29,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:29,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:29,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:29,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:29,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:29,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,799 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:29,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:29,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:29,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:29,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:29,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 157 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-15 20:33:30,000 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:30,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 41 [2019-11-15 20:33:30,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627387157] [2019-11-15 20:33:30,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 20:33:30,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 20:33:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1599, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 20:33:30,002 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand 42 states. [2019-11-15 20:33:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:33,570 INFO L93 Difference]: Finished difference Result 138 states and 172 transitions. [2019-11-15 20:33:33,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 20:33:33,614 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 85 [2019-11-15 20:33:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:33,616 INFO L225 Difference]: With dead ends: 138 [2019-11-15 20:33:33,616 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 20:33:33,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=351, Invalid=4619, Unknown=0, NotChecked=0, Total=4970 [2019-11-15 20:33:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 20:33:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 80. [2019-11-15 20:33:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 20:33:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-15 20:33:33,630 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 85 [2019-11-15 20:33:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:33,632 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-15 20:33:33,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 20:33:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-15 20:33:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 20:33:33,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:33,637 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:33,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:33,844 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2004188499, now seen corresponding path program 8 times [2019-11-15 20:33:33,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:33,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551139529] [2019-11-15 20:33:33,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:33,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:33,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-15 20:33:34,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551139529] [2019-11-15 20:33:34,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144251277] [2019-11-15 20:33:34,163 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:34,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:33:34,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:34,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 20:33:34,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-15 20:33:34,639 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:34,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2019-11-15 20:33:34,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682258522] [2019-11-15 20:33:34,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 20:33:34,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:34,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 20:33:34,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-15 20:33:34,642 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 24 states. [2019-11-15 20:33:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:34,984 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2019-11-15 20:33:34,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:33:34,985 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2019-11-15 20:33:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:34,986 INFO L225 Difference]: With dead ends: 87 [2019-11-15 20:33:34,986 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 20:33:34,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:33:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 20:33:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2019-11-15 20:33:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-15 20:33:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-11-15 20:33:34,991 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 90 [2019-11-15 20:33:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:34,992 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-11-15 20:33:34,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 20:33:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-11-15 20:33:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:33:34,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:34,993 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:35,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:35,194 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:35,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1079164488, now seen corresponding path program 8 times [2019-11-15 20:33:35,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:35,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332240673] [2019-11-15 20:33:35,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:35,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:35,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-15 20:33:36,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332240673] [2019-11-15 20:33:36,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820626712] [2019-11-15 20:33:36,236 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:36,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:33:36,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:36,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 117 conjunts are in the unsatisfiable core [2019-11-15 20:33:36,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:36,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:36,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:36,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,597 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 20:33:36,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:36,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:36,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:36,773 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:36,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:36,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:36,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:36,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:36,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:36,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:36,967 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:36,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:36,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:37,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:37,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:37,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:37,080 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,097 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:37,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:37,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:37,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:37,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,219 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:37,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:37,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:37,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:37,478 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#length)_AFTER_CALL_127|], 3=[|v_#valid_BEFORE_CALL_84|]} [2019-11-15 20:33:37,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:37,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:37,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 20:33:37,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,550 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-15 20:33:37,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:33:37,550 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2019-11-15 20:33:37,684 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_88|], 3=[|v_#valid_BEFORE_CALL_86|]} [2019-11-15 20:33:37,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:37,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:37,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 20:33:37,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:12 [2019-11-15 20:33:37,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:37,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 20:33:37,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:37,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:37,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:37,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-15 20:33:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 21 proven. 203 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 20:33:37,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:37,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2019-11-15 20:33:37,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922184416] [2019-11-15 20:33:37,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-15 20:33:37,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 20:33:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2109, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 20:33:37,973 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 48 states. [2019-11-15 20:33:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:41,923 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2019-11-15 20:33:41,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 20:33:41,923 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-11-15 20:33:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:41,925 INFO L225 Difference]: With dead ends: 142 [2019-11-15 20:33:41,925 INFO L226 Difference]: Without dead ends: 142 [2019-11-15 20:33:41,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=365, Invalid=4891, Unknown=0, NotChecked=0, Total=5256 [2019-11-15 20:33:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-15 20:33:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 85. [2019-11-15 20:33:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-15 20:33:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2019-11-15 20:33:41,933 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 94 [2019-11-15 20:33:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:41,933 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2019-11-15 20:33:41,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-15 20:33:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2019-11-15 20:33:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:33:41,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:41,935 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:42,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:42,136 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash 975447531, now seen corresponding path program 9 times [2019-11-15 20:33:42,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:42,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518737229] [2019-11-15 20:33:42,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:42,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:42,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-15 20:33:42,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518737229] [2019-11-15 20:33:42,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923785216] [2019-11-15 20:33:42,512 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:43,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 20:33:43,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:43,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:33:43,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-15 20:33:43,392 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:43,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2019-11-15 20:33:43,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212698648] [2019-11-15 20:33:43,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 20:33:43,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:43,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 20:33:43,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=434, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:33:43,395 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand 26 states. [2019-11-15 20:33:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:43,787 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2019-11-15 20:33:43,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:33:43,789 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2019-11-15 20:33:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:33:43,790 INFO L225 Difference]: With dead ends: 92 [2019-11-15 20:33:43,790 INFO L226 Difference]: Without dead ends: 92 [2019-11-15 20:33:43,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2019-11-15 20:33:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-15 20:33:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2019-11-15 20:33:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 20:33:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2019-11-15 20:33:43,796 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 99 [2019-11-15 20:33:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:33:43,796 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2019-11-15 20:33:43,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 20:33:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2019-11-15 20:33:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 20:33:43,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:33:43,798 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:44,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:44,004 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:33:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -114878986, now seen corresponding path program 9 times [2019-11-15 20:33:44,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346583729] [2019-11-15 20:33:44,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-15 20:33:45,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346583729] [2019-11-15 20:33:45,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57311977] [2019-11-15 20:33:45,232 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:33:45,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-15 20:33:45,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:33:45,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 97 conjunts are in the unsatisfiable core [2019-11-15 20:33:45,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:33:45,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:33:45,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:45,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:45,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:45,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-15 20:33:46,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:46,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-15 20:33:46,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:46,054 INFO L567 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2019-11-15 20:33:46,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:33:46,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:20 [2019-11-15 20:33:46,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,421 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:46,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 63 [2019-11-15 20:33:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:46,450 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:46,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 31 [2019-11-15 20:33:46,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:46,511 INFO L567 ElimStorePlain]: treesize reduction 63, result has 36.4 percent of original size [2019-11-15 20:33:46,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 20:33:46,511 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:36 [2019-11-15 20:33:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:46,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 31 [2019-11-15 20:33:46,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:46,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:46,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 63 [2019-11-15 20:33:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:46,874 INFO L567 ElimStorePlain]: treesize reduction 63, result has 36.4 percent of original size [2019-11-15 20:33:46,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 20:33:46,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:36 [2019-11-15 20:33:46,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:46,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:47,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 63 [2019-11-15 20:33:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:47,201 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:47,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 31 [2019-11-15 20:33:47,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:47,284 INFO L567 ElimStorePlain]: treesize reduction 64, result has 36.0 percent of original size [2019-11-15 20:33:47,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 20:33:47,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:36 [2019-11-15 20:33:47,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:47,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 31 [2019-11-15 20:33:47,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:47,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:47,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 63 [2019-11-15 20:33:47,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:47,812 INFO L567 ElimStorePlain]: treesize reduction 63, result has 36.4 percent of original size [2019-11-15 20:33:47,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 20:33:47,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:36 [2019-11-15 20:33:47,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:47,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:48,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 38 [2019-11-15 20:33:48,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:48,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:48,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 70 [2019-11-15 20:33:48,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:48,230 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-11-15 20:33:48,230 INFO L567 ElimStorePlain]: treesize reduction 64, result has 43.9 percent of original size [2019-11-15 20:33:48,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 20:33:48,232 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-11-15 20:33:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:48,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 74 [2019-11-15 20:33:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,557 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:33:48,615 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size [2019-11-15 20:33:48,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 20:33:48,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:50 [2019-11-15 20:33:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:49,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:49,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:50,492 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-15 20:33:50,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:51,174 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 20:33:51,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:51,250 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_151|], 6=[|v_#length_BEFORE_CALL_106|]} [2019-11-15 20:33:51,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:51,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2019-11-15 20:33:51,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:51,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:51,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2019-11-15 20:33:51,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:51,368 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.3 percent of original size [2019-11-15 20:33:51,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:51,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 73 [2019-11-15 20:33:51,392 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:51,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:51,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 74 [2019-11-15 20:33:51,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:51,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:51,418 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:51,529 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-11-15 20:33:51,529 INFO L567 ElimStorePlain]: treesize reduction 44, result has 71.4 percent of original size [2019-11-15 20:33:51,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:51,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:51,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 20:33:51,530 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:120, output treesize:70 [2019-11-15 20:33:52,284 WARN L191 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 20:33:52,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:33:52,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:33:52,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2019-11-15 20:33:52,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:52,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:52,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:52,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:52,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:52,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:52,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:52,452 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-11-15 20:33:52,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:52,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:33:52,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:52,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:52,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 20:33:52,802 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:33:52,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:33:52,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:33:52,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:20 [2019-11-15 20:33:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 78 proven. 242 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-15 20:33:52,937 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:33:52,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2019-11-15 20:33:52,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478042778] [2019-11-15 20:33:52,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-11-15 20:33:52,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-11-15 20:33:52,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2576, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 20:33:52,939 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand 53 states. [2019-11-15 20:34:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:34:01,187 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2019-11-15 20:34:01,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-15 20:34:01,187 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-11-15 20:34:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:34:01,189 INFO L225 Difference]: With dead ends: 166 [2019-11-15 20:34:01,189 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 20:34:01,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 96 SyntacticMatches, 23 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2119 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=840, Invalid=7902, Unknown=0, NotChecked=0, Total=8742 [2019-11-15 20:34:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 20:34:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2019-11-15 20:34:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 20:34:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2019-11-15 20:34:01,201 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 103 [2019-11-15 20:34:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:34:01,201 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2019-11-15 20:34:01,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-11-15 20:34:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2019-11-15 20:34:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-15 20:34:01,203 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:34:01,203 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:34:01,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:34:01,409 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_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_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:34:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:34:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash 830163053, now seen corresponding path program 10 times [2019-11-15 20:34:01,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:34:01,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910341418] [2019-11-15 20:34:01,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:34:01,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:34:01,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:34:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:34:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:34:01,604 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:34:01,604 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:34:01,633 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-15 20:34:01,640 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 41 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-11-15 20:34:01,641 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 42 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-11-15 20:34:01,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:34:01 BoogieIcfgContainer [2019-11-15 20:34:01,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:34:01,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:34:01,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:34:01,687 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:34:01,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:32:47" (3/4) ... [2019-11-15 20:34:01,691 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:34:01,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:34:01,692 INFO L168 Benchmark]: Toolchain (without parser) took 76531.61 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 734.0 MB). Free memory was 939.3 MB in the beginning and 870.9 MB in the end (delta: 68.4 MB). Peak memory consumption was 802.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:01,693 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:34:01,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:01,694 INFO L168 Benchmark]: Boogie Preprocessor took 112.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:01,694 INFO L168 Benchmark]: RCFGBuilder took 1372.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.2 MB in the end (delta: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:01,694 INFO L168 Benchmark]: TraceAbstraction took 74303.79 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 601.9 MB). Free memory was 975.2 MB in the beginning and 870.9 MB in the end (delta: 104.3 MB). Peak memory consumption was 706.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:01,695 INFO L168 Benchmark]: Witness Printer took 5.07 ms. Allocated memory is still 1.8 GB. Free memory is still 870.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:34:01,697 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 732.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1372.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.2 MB in the end (delta: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74303.79 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 601.9 MB). Free memory was 975.2 MB in the beginning and 870.9 MB in the end (delta: 104.3 MB). Peak memory consumption was 706.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.07 ms. Allocated memory is still 1.8 GB. Free memory is still 870.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 41 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 42 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: - UnprovableResult [Line: 773]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 773. Possible FailurePath: [L570] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-3:0}] [L774] CALL entry_point() VAL [ldv_global_msg_list={-3:0}] [L762] int len = 10; VAL [ldv_global_msg_list={-3:0}, len=10] [L763] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40, ldv_global_msg_list={-3:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=40, \result={-1:0}, ldv_global_msg_list={-3:0}, malloc(size)={-1:0}, size=40] [L763] RET, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_global_msg_list={-3:0}, ldv_malloc(sizeof(struct A18*)*len)={-1:0}, len=10] [L763] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L764] struct A18 *p; [L765] int i=0; VAL [array={-1:0}, i=0, ldv_global_msg_list={-3:0}, len=10] [L766] COND FALSE !(!array) VAL [array={-1:0}, i=0, ldv_global_msg_list={-3:0}, len=10] [L767] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 855ef959a267a6e57a6a3e6d7925f66e84a760d6 [2019-11-15 20:34:04,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:34:04,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:34:04,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:34:04,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:34:04,507 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:34:04,508 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2019-11-15 20:34:04,591 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data/f19e0c6ce/ed7169ec45144f59ba2404e1da97972d/FLAG52656bb1f [2019-11-15 20:34:05,172 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:34:05,173 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2019-11-15 20:34:05,202 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data/f19e0c6ce/ed7169ec45144f59ba2404e1da97972d/FLAG52656bb1f [2019-11-15 20:34:05,451 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/data/f19e0c6ce/ed7169ec45144f59ba2404e1da97972d [2019-11-15 20:34:05,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:34:05,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 20:34:05,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:34:05,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:34:05,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:34:05,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:34:05" (1/1) ... [2019-11-15 20:34:05,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6adca37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:05, skipping insertion in model container [2019-11-15 20:34:05,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:34:05" (1/1) ... [2019-11-15 20:34:05,478 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:34:05,530 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:34:06,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:34:06,129 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:34:06,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:34:06,294 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:34:06,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06 WrapperNode [2019-11-15 20:34:06,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:34:06,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:34:06,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:34:06,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:34:06,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (1/1) ... [2019-11-15 20:34:06,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (1/1) ... [2019-11-15 20:34:06,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (1/1) ... [2019-11-15 20:34:06,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (1/1) ... [2019-11-15 20:34:06,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (1/1) ... [2019-11-15 20:34:06,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (1/1) ... [2019-11-15 20:34:06,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (1/1) ... [2019-11-15 20:34:06,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:34:06,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:34:06,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:34:06,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:34:06,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:34:06,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 20:34:06,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:34:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-15 20:34:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 20:34:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 20:34:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 20:34:06,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 20:34:06,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 20:34:06,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-15 20:34:06,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-15 20:34:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-15 20:34:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-15 20:34:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-15 20:34:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-15 20:34:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-15 20:34:06,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-15 20:34:06,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-15 20:34:06,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-15 20:34:06,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-15 20:34:06,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-15 20:34:06,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-15 20:34:06,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-15 20:34:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-15 20:34:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-15 20:34:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-15 20:34:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-15 20:34:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-15 20:34:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-15 20:34:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-15 20:34:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-15 20:34:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-15 20:34:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-15 20:34:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-15 20:34:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-15 20:34:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-15 20:34:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-15 20:34:06,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-15 20:34:06,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-15 20:34:06,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-15 20:34:06,476 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-15 20:34:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-15 20:34:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-15 20:34:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 20:34:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-15 20:34:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-15 20:34:06,478 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-15 20:34:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 20:34:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 20:34:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 20:34:06,479 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 20:34:06,479 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 20:34:06,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 20:34:06,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 20:34:06,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 20:34:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 20:34:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 20:34:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 20:34:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 20:34:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 20:34:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 20:34:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 20:34:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 20:34:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 20:34:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 20:34:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 20:34:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 20:34:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 20:34:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 20:34:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 20:34:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 20:34:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 20:34:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 20:34:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 20:34:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 20:34:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 20:34:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 20:34:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 20:34:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 20:34:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 20:34:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 20:34:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 20:34:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 20:34:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 20:34:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 20:34:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 20:34:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 20:34:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 20:34:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 20:34:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 20:34:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 20:34:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 20:34:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 20:34:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 20:34:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 20:34:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 20:34:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 20:34:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 20:34:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 20:34:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 20:34:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 20:34:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 20:34:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 20:34:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 20:34:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 20:34:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 20:34:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 20:34:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 20:34:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 20:34:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 20:34:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 20:34:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 20:34:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 20:34:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 20:34:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 20:34:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 20:34:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 20:34:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 20:34:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 20:34:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 20:34:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 20:34:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 20:34:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 20:34:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 20:34:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 20:34:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 20:34:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 20:34:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 20:34:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 20:34:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 20:34:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 20:34:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 20:34:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 20:34:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 20:34:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 20:34:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 20:34:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 20:34:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 20:34:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 20:34:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 20:34:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 20:34:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 20:34:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 20:34:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 20:34:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 20:34:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 20:34:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 20:34:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 20:34:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 20:34:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 20:34:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 20:34:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 20:34:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 20:34:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 20:34:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-15 20:34:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 20:34:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-15 20:34:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-15 20:34:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-15 20:34:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-15 20:34:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-15 20:34:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-15 20:34:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:34:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-15 20:34:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-15 20:34:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-15 20:34:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:34:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-15 20:34:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-15 20:34:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-15 20:34:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:34:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-15 20:34:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-15 20:34:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-15 20:34:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-15 20:34:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-15 20:34:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-15 20:34:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:34:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-15 20:34:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-15 20:34:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-15 20:34:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-15 20:34:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-15 20:34:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:34:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 20:34:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-15 20:34:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-15 20:34:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-15 20:34:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-15 20:34:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-15 20:34:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-15 20:34:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-15 20:34:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-15 20:34:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-15 20:34:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-15 20:34:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-15 20:34:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-15 20:34:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-15 20:34:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-15 20:34:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-15 20:34:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-15 20:34:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-15 20:34:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-15 20:34:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 20:34:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 20:34:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:34:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 20:34:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:34:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-15 20:34:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-15 20:34:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-15 20:34:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-15 20:34:07,242 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:34:07,818 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:34:08,320 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:34:08,322 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-15 20:34:08,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:34:08 BoogieIcfgContainer [2019-11-15 20:34:08,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:34:08,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:34:08,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:34:08,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:34:08,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:34:05" (1/3) ... [2019-11-15 20:34:08,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bd184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:34:08, skipping insertion in model container [2019-11-15 20:34:08,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:34:06" (2/3) ... [2019-11-15 20:34:08,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bd184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:34:08, skipping insertion in model container [2019-11-15 20:34:08,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:34:08" (3/3) ... [2019-11-15 20:34:08,336 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3.i [2019-11-15 20:34:08,347 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:34:08,360 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2019-11-15 20:34:08,373 INFO L249 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2019-11-15 20:34:08,397 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:34:08,397 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 20:34:08,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:34:08,398 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:34:08,398 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:34:08,398 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:34:08,398 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:34:08,398 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:34:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-11-15 20:34:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:34:08,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:34:08,438 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:34:08,442 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 20:34:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:34:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash 553965932, now seen corresponding path program 1 times [2019-11-15 20:34:08,463 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:34:08,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1543645416] [2019-11-15 20:34:08,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a227d17-eacd-48ca-ab5b-3d8daaf6be14/bin/uautomizer/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-11-15 20:34:08,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:34:08,719 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-11-15 20:34:08,724 INFO L168 Benchmark]: Toolchain (without parser) took 3267.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -55.4 MB). Peak memory consumption was 105.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:08,725 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:34:08,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:08,728 INFO L168 Benchmark]: Boogie Preprocessor took 114.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:08,728 INFO L168 Benchmark]: RCFGBuilder took 1914.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.5 MB). Peak memory consumption was 109.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:08,729 INFO L168 Benchmark]: TraceAbstraction took 395.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:34:08,732 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.95 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 837.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1914.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.5 MB). Peak memory consumption was 109.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 395.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...