./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 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_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/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 802e06fc98e2f59a627183597248911673af75c3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 11:31:13,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:31:13,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:31:13,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:31:13,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:31:13,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:31:13,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:31:13,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:31:13,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:31:13,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:31:13,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:31:13,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:31:13,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:31:13,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:31:13,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:31:13,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:31:13,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:31:13,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:31:13,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:31:13,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:31:13,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:31:13,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:31:13,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:31:13,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:31:13,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:31:13,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:31:13,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:31:13,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:31:13,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:31:13,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:31:13,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:31:13,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:31:13,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:31:13,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:31:13,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:31:13,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:31:13,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:31:13,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:31:13,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:31:13,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:31:13,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:31:13,112 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 11:31:13,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:31:13,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:31:13,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:31:13,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:31:13,134 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:31:13,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:31:13,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:31:13,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:31:13,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:31:13,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:31:13,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:31:13,136 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 11:31:13,136 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 11:31:13,136 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 11:31:13,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:31:13,137 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:31:13,137 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:31:13,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:31:13,137 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:31:13,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:31:13,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:31:13,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:31:13,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:31:13,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:31:13,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:31:13,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:31:13,139 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:31:13,139 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:31:13,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:31:13,140 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/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 -> 802e06fc98e2f59a627183597248911673af75c3 [2019-11-20 11:31:13,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:31:13,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:31:13,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:31:13,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:31:13,304 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:31:13,304 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2019-11-20 11:31:13,371 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/data/7f986e27e/b14560d50d0444c299258ee26dabf474/FLAG560b1a0ed [2019-11-20 11:31:13,897 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:31:13,898 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2019-11-20 11:31:13,911 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/data/7f986e27e/b14560d50d0444c299258ee26dabf474/FLAG560b1a0ed [2019-11-20 11:31:14,378 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/data/7f986e27e/b14560d50d0444c299258ee26dabf474 [2019-11-20 11:31:14,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:31:14,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 11:31:14,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:31:14,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:31:14,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:31:14,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:31:14" (1/1) ... [2019-11-20 11:31:14,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e575ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:14, skipping insertion in model container [2019-11-20 11:31:14,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:31:14" (1/1) ... [2019-11-20 11:31:14,397 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:31:14,461 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:31:14,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:31:14,890 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:31:14,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:31:15,021 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:31:15,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15 WrapperNode [2019-11-20 11:31:15,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:31:15,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:31:15,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:31:15,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:31:15,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (1/1) ... [2019-11-20 11:31:15,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (1/1) ... [2019-11-20 11:31:15,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (1/1) ... [2019-11-20 11:31:15,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (1/1) ... [2019-11-20 11:31:15,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (1/1) ... [2019-11-20 11:31:15,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (1/1) ... [2019-11-20 11:31:15,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (1/1) ... [2019-11-20 11:31:15,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:31:15,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:31:15,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:31:15,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:31:15,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/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-20 11:31:15,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 11:31:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:31:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-20 11:31:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 11:31:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 11:31:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 11:31:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 11:31:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 11:31:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-20 11:31:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-20 11:31:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-20 11:31:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-20 11:31:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-20 11:31:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-20 11:31:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-20 11:31:15,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-20 11:31:15,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-20 11:31:15,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-20 11:31:15,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-20 11:31:15,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-20 11:31:15,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-20 11:31:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-20 11:31:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-20 11:31:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-20 11:31:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-20 11:31:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-20 11:31:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-20 11:31:15,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-20 11:31:15,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-20 11:31:15,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-20 11:31:15,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-20 11:31:15,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-20 11:31:15,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-20 11:31:15,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-20 11:31:15,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-20 11:31:15,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-20 11:31:15,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-20 11:31:15,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-20 11:31:15,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-20 11:31:15,186 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-20 11:31:15,186 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-20 11:31:15,186 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-11-20 11:31:15,186 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-20 11:31:15,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 11:31:15,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-20 11:31:15,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-20 11:31:15,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-20 11:31:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 11:31:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 11:31:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 11:31:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 11:31:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 11:31:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 11:31:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 11:31:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 11:31:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 11:31:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 11:31:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 11:31:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 11:31:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 11:31:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 11:31:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 11:31:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 11:31:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 11:31:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 11:31:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 11:31:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 11:31:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 11:31:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 11:31:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 11:31:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 11:31:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 11:31:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 11:31:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 11:31:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 11:31:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 11:31:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 11:31:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 11:31:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 11:31:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 11:31:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 11:31:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 11:31:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 11:31:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 11:31:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 11:31:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 11:31:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 11:31:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 11:31:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 11:31:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 11:31:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 11:31:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 11:31:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 11:31:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 11:31:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 11:31:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 11:31:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 11:31:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 11:31:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 11:31:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 11:31:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 11:31:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 11:31:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 11:31:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 11:31:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 11:31:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 11:31:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 11:31:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 11:31:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 11:31:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 11:31:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 11:31:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 11:31:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 11:31:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 11:31:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 11:31:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 11:31:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 11:31:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 11:31:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 11:31:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 11:31:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 11:31:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 11:31:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 11:31:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 11:31:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 11:31:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 11:31:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 11:31:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 11:31:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 11:31:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 11:31:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 11:31:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 11:31:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 11:31:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 11:31:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 11:31:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 11:31:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 11:31:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 11:31:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 11:31:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 11:31:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 11:31:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 11:31:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 11:31:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 11:31:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 11:31:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 11:31:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 11:31:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 11:31:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 11:31:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 11:31:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 11:31:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 11:31:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 11:31:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 11:31:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 11:31:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 11:31:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-20 11:31:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-20 11:31:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-20 11:31:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-20 11:31:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-20 11:31:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-20 11:31:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:31:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-20 11:31:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-20 11:31:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-20 11:31:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:31:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-20 11:31:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-20 11:31:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-20 11:31:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:31:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-20 11:31:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-20 11:31:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-20 11:31:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-20 11:31:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-20 11:31:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-20 11:31:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:31:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-20 11:31:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-20 11:31:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-20 11:31:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-20 11:31:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-20 11:31:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 11:31:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 11:31:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-20 11:31:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-20 11:31:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-20 11:31:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-20 11:31:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-20 11:31:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-20 11:31:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-20 11:31:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-20 11:31:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-20 11:31:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-20 11:31:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-20 11:31:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-20 11:31:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-20 11:31:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-20 11:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-20 11:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-20 11:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-20 11:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-11-20 11:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-20 11:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 11:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 11:31:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:31:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 11:31:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:31:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-20 11:31:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-20 11:31:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-20 11:31:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-20 11:31:15,888 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 11:31:16,272 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 11:31:16,627 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:31:16,627 INFO L285 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-20 11:31:16,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:16 BoogieIcfgContainer [2019-11-20 11:31:16,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:31:16,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:31:16,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:31:16,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:31:16,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:31:14" (1/3) ... [2019-11-20 11:31:16,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665413aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:31:16, skipping insertion in model container [2019-11-20 11:31:16,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:15" (2/3) ... [2019-11-20 11:31:16,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665413aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:31:16, skipping insertion in model container [2019-11-20 11:31:16,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:16" (3/3) ... [2019-11-20 11:31:16,636 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test13_1.i [2019-11-20 11:31:16,645 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:31:16,652 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-20 11:31:16,662 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-20 11:31:16,680 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:31:16,680 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 11:31:16,680 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:31:16,680 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:31:16,680 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:31:16,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:31:16,681 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:31:16,681 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:31:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-20 11:31:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 11:31:16,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:16,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:16,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:31:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash -221537282, now seen corresponding path program 1 times [2019-11-20 11:31:16,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:16,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1412287086] [2019-11-20 11:31:16,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/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-20 11:31:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:17,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 11:31:17,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:17,261 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:31:17,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 11:31:17,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:17,325 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2019-11-20 11:31:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:17,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:31:17,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:32 [2019-11-20 11:31:17,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:17,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-20 11:31:17,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:17,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:17,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:17,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-20 11:31:17,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-20 11:31:17,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:17,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:17,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:17,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-20 11:31:17,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:17,459 INFO L377 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 19 treesize of output 41 [2019-11-20 11:31:17,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:17,484 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 11:31:17,485 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-20 11:31:17,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-20 11:31:17,590 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-20 11:31:17,591 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:17,944 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-20 11:31:17,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1412287086] [2019-11-20 11:31:17,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:17,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-20 11:31:17,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821383453] [2019-11-20 11:31:17,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 11:31:17,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 11:31:17,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:31:17,989 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 14 states. [2019-11-20 11:31:19,606 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-20 11:31:20,748 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-20 11:31:26,247 WARN L191 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-20 11:31:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:30,469 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-11-20 11:31:30,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:31:30,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-20 11:31:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:30,491 INFO L225 Difference]: With dead ends: 92 [2019-11-20 11:31:30,491 INFO L226 Difference]: Without dead ends: 80 [2019-11-20 11:31:30,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-11-20 11:31:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-20 11:31:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-11-20 11:31:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 11:31:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-20 11:31:30,554 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2019-11-20 11:31:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:30,555 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-20 11:31:30,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 11:31:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-20 11:31:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 11:31:30,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:30,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:30,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:30,761 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:31:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash -221537281, now seen corresponding path program 1 times [2019-11-20 11:31:30,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:30,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1726687016] [2019-11-20 11:31:30,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:31,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 11:31:31,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:31,130 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:31:31,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 11:31:31,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,210 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-11-20 11:31:31,226 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 11:31:31,227 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 11:31:31,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:31,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:31,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:31:31,250 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:45 [2019-11-20 11:31:31,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:31,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:31,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:31,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2019-11-20 11:31:31,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-11-20 11:31:31,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,347 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 11:31:31,348 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:31,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 11:31:31,397 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:126, output treesize:66 [2019-11-20 11:31:31,512 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_2, |v_#length_BEFORE_CALL_4|], 1=[v_prenex_1, |v_#valid_BEFORE_CALL_10|]} [2019-11-20 11:31:31,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-20 11:31:31,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:31,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2019-11-20 11:31:31,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:31,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:31,634 INFO L377 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 22 treesize of output 26 [2019-11-20 11:31:31,635 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,661 INFO L567 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-11-20 11:31:31,662 INFO L464 ElimStorePlain]: Eliminatee |v_#valid_BEFORE_CALL_10| vanished before elimination [2019-11-20 11:31:31,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:31,662 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:10 [2019-11-20 11:31:33,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:31:33,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:33,743 INFO L377 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 32 treesize of output 34 [2019-11-20 11:31:33,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:33,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:33,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:33,777 INFO L377 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 34 treesize of output 61 [2019-11-20 11:31:33,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:33,870 INFO L567 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size [2019-11-20 11:31:33,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:33,888 INFO L377 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 31 treesize of output 35 [2019-11-20 11:31:33,889 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:33,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:33,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2019-11-20 11:31:33,928 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:33,971 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-20 11:31:33,972 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-20 11:31:33,972 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:9 [2019-11-20 11:31:34,033 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-20 11:31:34,033 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:34,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:36,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:37,280 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-20 11:31:37,292 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 39 [2019-11-20 11:31:37,976 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-20 11:31:38,590 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-20 11:31:38,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726687016] [2019-11-20 11:31:38,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:38,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 11:31:38,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215766022] [2019-11-20 11:31:38,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 11:31:38,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 11:31:38,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=185, Unknown=2, NotChecked=0, Total=240 [2019-11-20 11:31:38,593 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 16 states. [2019-11-20 11:31:59,884 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-11-20 11:32:08,266 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-20 11:32:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:32:16,593 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-20 11:32:16,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 11:32:16,594 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-11-20 11:32:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:32:16,595 INFO L225 Difference]: With dead ends: 79 [2019-11-20 11:32:16,595 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 11:32:16,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=176, Invalid=422, Unknown=2, NotChecked=0, Total=600 [2019-11-20 11:32:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 11:32:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2019-11-20 11:32:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 11:32:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-11-20 11:32:16,603 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 17 [2019-11-20 11:32:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:32:16,603 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-11-20 11:32:16,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 11:32:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-11-20 11:32:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 11:32:16,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:32:16,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:32:16,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:32:16,811 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:32:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:32:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1547904578, now seen corresponding path program 1 times [2019-11-20 11:32:16,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:32:16,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [218499571] [2019-11-20 11:32:16,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:32:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:32:17,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 11:32:17,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:32:17,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-20 11:32:17,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2019-11-20 11:32:17,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:32:17,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-11-20 11:32:17,220 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-20 11:32:17,221 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:32:17,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,231 INFO L377 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 16 treesize of output 20 [2019-11-20 11:32:17,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:32:17,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-20 11:32:17,381 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-20 11:32:17,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [218499571] [2019-11-20 11:32:17,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:32:17,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2019-11-20 11:32:17,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223000160] [2019-11-20 11:32:17,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:32:17,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:32:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:32:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:32:17,383 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 12 states. [2019-11-20 11:32:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:32:18,099 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-20 11:32:18,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:32:18,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-20 11:32:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:32:18,101 INFO L225 Difference]: With dead ends: 78 [2019-11-20 11:32:18,101 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 11:32:18,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:32:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 11:32:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2019-11-20 11:32:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-20 11:32:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-11-20 11:32:18,110 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 20 [2019-11-20 11:32:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:32:18,111 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-11-20 11:32:18,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:32:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-11-20 11:32:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 11:32:18,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:32:18,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:32:18,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:32:18,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:32:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:32:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1547904579, now seen corresponding path program 1 times [2019-11-20 11:32:18,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:32:18,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1496429400] [2019-11-20 11:32:18,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:32:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:32:18,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-20 11:32:18,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:32:18,713 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:32:18,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 11:32:18,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:18,817 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-20 11:32:18,817 INFO L567 ElimStorePlain]: treesize reduction 10, result has 87.0 percent of original size [2019-11-20 11:32:18,844 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 11:32:18,844 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 11:32:18,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:18,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:18,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:18,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:32:18,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:68 [2019-11-20 11:32:18,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:18,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:18,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:18,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:18,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:18,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:19,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:19,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:19,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 91 [2019-11-20 11:32:19,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:19,062 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:19,063 INFO L377 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 66 treesize of output 70 [2019-11-20 11:32:19,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:19,067 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 11:32:19,068 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:19,201 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-20 11:32:19,202 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.0 percent of original size [2019-11-20 11:32:19,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:19,217 INFO L377 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 52 treesize of output 56 [2019-11-20 11:32:19,217 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:19,220 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 11:32:19,221 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:19,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:19,237 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-20 11:32:19,237 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:211, output treesize:42 [2019-11-20 11:32:21,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:21,341 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:21,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 87 [2019-11-20 11:32:21,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:21,352 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:32:21,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:32:21,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:21,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 78 [2019-11-20 11:32:21,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:21,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:21,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 118 [2019-11-20 11:32:21,412 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:21,603 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-20 11:32:21,603 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.9 percent of original size [2019-11-20 11:32:21,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:21,634 INFO L377 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 60 treesize of output 73 [2019-11-20 11:32:21,635 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:21,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:21,654 INFO L377 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 62 treesize of output 75 [2019-11-20 11:32:21,655 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:21,815 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-20 11:32:21,816 INFO L567 ElimStorePlain]: treesize reduction 10, result has 92.4 percent of original size [2019-11-20 11:32:21,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 11:32:21,817 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:224, output treesize:95 [2019-11-20 11:32:21,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:32:21,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:21,993 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.5 percent of original size [2019-11-20 11:32:21,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:32:21,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:22,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:22,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:22,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:9 [2019-11-20 11:32:22,079 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-20 11:32:22,080 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:32:22,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:23,187 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 11:32:25,637 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 11:32:25,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:25,663 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-20 11:32:28,559 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-20 11:32:28,576 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-20 11:32:31,886 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-20 11:32:35,535 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-20 11:32:35,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1496429400] [2019-11-20 11:32:35,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:32:35,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 20 [2019-11-20 11:32:35,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271837536] [2019-11-20 11:32:35,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 11:32:35,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:32:35,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 11:32:35,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=359, Unknown=2, NotChecked=0, Total=420 [2019-11-20 11:32:35,539 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 21 states. [2019-11-20 11:32:44,832 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-20 11:32:47,559 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 11:32:49,682 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 11:32:50,126 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 11:32:54,973 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-11-20 11:33:08,881 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-11-20 11:33:13,962 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2019-11-20 11:33:35,617 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-11-20 11:33:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:36,679 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-11-20 11:33:36,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 11:33:36,681 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-11-20 11:33:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:36,683 INFO L225 Difference]: With dead ends: 77 [2019-11-20 11:33:36,683 INFO L226 Difference]: Without dead ends: 77 [2019-11-20 11:33:36,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=263, Invalid=995, Unknown=2, NotChecked=0, Total=1260 [2019-11-20 11:33:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-20 11:33:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2019-11-20 11:33:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 11:33:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-11-20 11:33:36,692 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 20 [2019-11-20 11:33:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:36,692 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-11-20 11:33:36,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 11:33:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-11-20 11:33:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:33:36,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:36,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:36,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:36,906 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:36,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:36,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1770744447, now seen corresponding path program 1 times [2019-11-20 11:33:36,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:36,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [778317217] [2019-11-20 11:33:36,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:37,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:33:37,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:37,144 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-20 11:33:37,144 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:37,209 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-20 11:33:37,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778317217] [2019-11-20 11:33:37,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:37,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 11:33:37,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040319765] [2019-11-20 11:33:37,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:33:37,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:33:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:33:37,211 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2019-11-20 11:33:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:37,222 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-20 11:33:37,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:33:37,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 11:33:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:37,223 INFO L225 Difference]: With dead ends: 58 [2019-11-20 11:33:37,223 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 11:33:37,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:33:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 11:33:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-20 11:33:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 11:33:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-20 11:33:37,233 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 19 [2019-11-20 11:33:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:37,233 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-20 11:33:37,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:33:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-20 11:33:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:33:37,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:37,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:37,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:37,436 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:37,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1574230942, now seen corresponding path program 1 times [2019-11-20 11:33:37,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:37,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [222107305] [2019-11-20 11:33:37,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:37,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 11:33:37,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:37,699 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:33:37,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 11:33:37,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:37,738 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2019-11-20 11:33:37,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:33:37,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:33:37,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:32 [2019-11-20 11:33:37,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:33:37,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-20 11:33:37,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:37,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:37,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:37,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-20 11:33:37,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-20 11:33:37,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:37,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:37,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:37,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-20 11:33:37,815 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-20 11:33:37,815 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:37,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:33:37,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-20 11:33:37,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:37,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:37,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:37,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2019-11-20 11:33:37,953 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-20 11:33:37,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [222107305] [2019-11-20 11:33:37,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:37,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2019-11-20 11:33:37,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649109878] [2019-11-20 11:33:37,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:33:37,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:37,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:33:37,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:33:37,955 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 8 states. [2019-11-20 11:33:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:44,497 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-20 11:33:44,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:33:44,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 11:33:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:44,499 INFO L225 Difference]: With dead ends: 66 [2019-11-20 11:33:44,499 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 11:33:44,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:33:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 11:33:44,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-20 11:33:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 11:33:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-20 11:33:44,521 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 19 [2019-11-20 11:33:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:44,521 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-20 11:33:44,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:33:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-20 11:33:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:33:44,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:44,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:44,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:44,724 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1574230943, now seen corresponding path program 1 times [2019-11-20 11:33:44,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:44,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2076419283] [2019-11-20 11:33:44,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:44,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 11:33:44,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:44,977 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 11:33:44,977 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 11:33:44,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:44,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:44,997 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-20 11:33:44,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-20 11:33:45,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-20 11:33:45,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:45,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:45,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:45,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2019-11-20 11:33:45,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-20 11:33:45,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:45,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:45,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:45,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-20 11:33:45,148 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-20 11:33:45,148 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:45,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:33:45,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-20 11:33:45,627 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-20 11:33:45,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:45,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:33:45,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2019-11-20 11:33:45,869 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-20 11:33:45,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2076419283] [2019-11-20 11:33:45,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:45,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-20 11:33:45,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894079834] [2019-11-20 11:33:45,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 11:33:45,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 11:33:45,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-20 11:33:45,871 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 11 states. [2019-11-20 11:33:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:47,455 INFO L93 Difference]: Finished difference Result 86 states and 85 transitions. [2019-11-20 11:33:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:33:47,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-20 11:33:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:47,456 INFO L225 Difference]: With dead ends: 86 [2019-11-20 11:33:47,456 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 11:33:47,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:33:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 11:33:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-11-20 11:33:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 11:33:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-11-20 11:33:47,462 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2019-11-20 11:33:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:47,463 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2019-11-20 11:33:47,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 11:33:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2019-11-20 11:33:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:33:47,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:47,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:47,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:47,669 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 740401709, now seen corresponding path program 1 times [2019-11-20 11:33:47,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:47,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1605516238] [2019-11-20 11:33:47,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:47,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 11:33:47,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:47,924 INFO L377 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-20 11:33:47,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:47,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:47,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:47,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:33:47,982 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-20 11:33:47,983 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:48,196 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-20 11:33:48,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1605516238] [2019-11-20 11:33:48,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:48,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 13 [2019-11-20 11:33:48,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517687486] [2019-11-20 11:33:48,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 11:33:48,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:48,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 11:33:48,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:33:48,197 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 14 states. [2019-11-20 11:33:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:48,879 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2019-11-20 11:33:48,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:33:48,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-20 11:33:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:48,881 INFO L225 Difference]: With dead ends: 64 [2019-11-20 11:33:48,881 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 11:33:48,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:33:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 11:33:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-11-20 11:33:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 11:33:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-11-20 11:33:48,887 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 21 [2019-11-20 11:33:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:48,887 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-11-20 11:33:48,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 11:33:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-11-20 11:33:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:33:48,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:48,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:49,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:49,090 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash 740401710, now seen corresponding path program 1 times [2019-11-20 11:33:49,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:49,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1191300250] [2019-11-20 11:33:49,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:49,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 11:33:49,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:49,412 INFO L377 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-20 11:33:49,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:49,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:49,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:49,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:33:49,536 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-20 11:33:49,536 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:50,333 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-20 11:33:50,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1191300250] [2019-11-20 11:33:50,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:50,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-20 11:33:50,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974262666] [2019-11-20 11:33:50,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 11:33:50,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:50,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 11:33:50,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:33:50,335 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 18 states. [2019-11-20 11:33:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:51,712 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2019-11-20 11:33:51,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:33:51,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-20 11:33:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:51,715 INFO L225 Difference]: With dead ends: 62 [2019-11-20 11:33:51,715 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 11:33:51,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-20 11:33:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 11:33:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-20 11:33:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 11:33:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-11-20 11:33:51,721 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 21 [2019-11-20 11:33:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:51,722 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-11-20 11:33:51,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 11:33:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-11-20 11:33:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:33:51,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:51,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:51,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:51,936 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash 869484428, now seen corresponding path program 1 times [2019-11-20 11:33:51,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:51,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [149427476] [2019-11-20 11:33:51,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:52,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:33:52,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:52,307 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-20 11:33:52,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:52,345 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-20 11:33:52,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [149427476] [2019-11-20 11:33:52,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:52,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 11:33:52,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199419746] [2019-11-20 11:33:52,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:33:52,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:33:52,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:33:52,347 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 5 states. [2019-11-20 11:33:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:52,361 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2019-11-20 11:33:52,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:33:52,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 11:33:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:52,362 INFO L225 Difference]: With dead ends: 48 [2019-11-20 11:33:52,362 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 11:33:52,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:33:52,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 11:33:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-20 11:33:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 11:33:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2019-11-20 11:33:52,366 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 21 [2019-11-20 11:33:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:52,366 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2019-11-20 11:33:52,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:33:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2019-11-20 11:33:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 11:33:52,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:52,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:52,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:52,568 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1438527184, now seen corresponding path program 1 times [2019-11-20 11:33:52,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:52,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1491981638] [2019-11-20 11:33:52,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:52,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:33:52,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:52,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-20 11:33:52,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:52,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:52,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:52,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2019-11-20 11:33:52,949 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-20 11:33:52,949 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:52,977 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-20 11:33:52,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1491981638] [2019-11-20 11:33:52,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:52,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-20 11:33:52,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330521107] [2019-11-20 11:33:52,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:33:52,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:52,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:33:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:33:52,979 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 6 states. [2019-11-20 11:33:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:53,347 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2019-11-20 11:33:53,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 11:33:53,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-20 11:33:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:53,349 INFO L225 Difference]: With dead ends: 43 [2019-11-20 11:33:53,349 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 11:33:53,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:33:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 11:33:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-20 11:33:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 11:33:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2019-11-20 11:33:53,353 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 23 [2019-11-20 11:33:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:53,353 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2019-11-20 11:33:53,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:33:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2019-11-20 11:33:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 11:33:53,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:53,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:53,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:53,555 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1438527183, now seen corresponding path program 1 times [2019-11-20 11:33:53,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:53,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1348695425] [2019-11-20 11:33:53,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:53,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 11:33:53,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:53,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:33:53,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:54,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:54,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:33:54,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:54,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:54,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:54,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:10 [2019-11-20 11:33:54,180 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-20 11:33:54,180 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:54,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:33:54,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2019-11-20 11:33:54,310 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-20 11:33:54,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-11-20 11:33:54,339 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:33:54,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:54,368 INFO L377 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 30 treesize of output 34 [2019-11-20 11:33:54,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:33:54,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:33:54,370 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:33:54,567 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:33:54,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:54,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:33:54,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 11:33:54,570 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:85 [2019-11-20 11:33:54,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:33:54,928 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-20 11:33:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:33:55,314 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-20 11:33:55,581 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 11:33:55,835 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 11:33:56,182 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 11:33:56,491 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 11:33:56,583 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-20 11:33:56,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1348695425] [2019-11-20 11:33:56,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:56,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 11:33:56,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434161907] [2019-11-20 11:33:56,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 11:33:56,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 11:33:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:33:56,586 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 16 states. [2019-11-20 11:33:57,818 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 11:33:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:58,576 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2019-11-20 11:33:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:33:58,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 11:33:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:58,579 INFO L225 Difference]: With dead ends: 42 [2019-11-20 11:33:58,579 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 11:33:58,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-11-20 11:33:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 11:33:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 11:33:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 11:33:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2019-11-20 11:33:58,583 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 23 [2019-11-20 11:33:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:58,583 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2019-11-20 11:33:58,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 11:33:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2019-11-20 11:33:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 11:33:58,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:58,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:58,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:58,785 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:33:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash 998521758, now seen corresponding path program 1 times [2019-11-20 11:33:58,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:58,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2134394728] [2019-11-20 11:33:58,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a9ba5a4-557a-473f-b798-8978bbbd57ad/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:59,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 11:33:59,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:59,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:33:59,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-20 11:33:59,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:59,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:59,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:33:59,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:59,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 7 [2019-11-20 11:33:59,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:59,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:59,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:59,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:10 [2019-11-20 11:33:59,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:33:59,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 32 treesize of output 18 [2019-11-20 11:33:59,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:59,604 INFO L567 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2019-11-20 11:33:59,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:33:59,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:59,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 14 [2019-11-20 11:33:59,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:59,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:59,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:59,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:11 [2019-11-20 11:33:59,763 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-20 11:33:59,763 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:34:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:00,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-11-20 11:34:00,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-20 11:34:00,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2019-11-20 11:34:00,582 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:00,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:00,605 INFO L377 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 50 treesize of output 54 [2019-11-20 11:34:00,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:00,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:00,607 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:00,730 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 11:34:00,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:00,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:00,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 11:34:00,732 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:145, output treesize:137 [2019-11-20 11:34:00,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:01,262 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-11-20 11:34:01,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:01,812 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-20 11:34:02,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:02,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:02,228 INFO L377 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 77 treesize of output 81 [2019-11-20 11:34:02,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:02,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:02,229 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:02,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:02,281 INFO L377 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 74 treesize of output 78 [2019-11-20 11:34:02,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:02,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:02,283 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:02,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2019-11-20 11:34:02,311 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:02,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-11-20 11:34:02,341 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:02,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:02,449 INFO L377 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 65 treesize of output 69 [2019-11-20 11:34:02,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:02,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:02,450 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:02,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-11-20 11:34:02,476 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:02,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:02,554 INFO L377 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 59 treesize of output 63 [2019-11-20 11:34:02,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:02,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:02,556 INFO L496 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:02,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2019-11-20 11:34:02,599 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:03,187 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-20 11:34:03,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:03,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2019-11-20 11:34:03,191 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:512, output treesize:504 [2019-11-20 11:34:03,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,193 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 11:34:03,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:03,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,832 WARN L191 SmtUtils]: Spent 16.87 s on a formula simplification. DAG size of input: 179 DAG size of output: 57 [2019-11-20 11:34:20,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 11:34:20,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 11:34:20,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 11:34:20,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 11:34:20,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 11:34:20,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 11:34:20,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 11:34:20,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:20,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:20,891 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-20 11:34:20,923 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-11-20 11:34:21,041 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6650 conjuctions. This might take some time... [2019-11-20 11:34:21,097 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 21 conjuctions. [2019-11-20 11:34:21,100 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 19 [2019-11-20 11:34:21,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:34:21,314 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) 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.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-20 11:34:21,317 INFO L168 Benchmark]: Toolchain (without parser) took 186935.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 278.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:21,317 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:34:21,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:21,318 INFO L168 Benchmark]: Boogie Preprocessor took 86.21 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:21,319 INFO L168 Benchmark]: RCFGBuilder took 1519.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.9 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:21,319 INFO L168 Benchmark]: TraceAbstraction took 184686.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.8 MB). Free memory was 988.9 MB in the beginning and 1.1 GB in the end (delta: -99.9 MB). Peak memory consumption was 183.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:21,321 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 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 639.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.21 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1519.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.9 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 184686.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.8 MB). Free memory was 988.9 MB in the beginning and 1.1 GB in the end (delta: -99.9 MB). Peak memory consumption was 183.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...