./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.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_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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 50623fcce85e4b85b0accc998d09712632377f90 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:37,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:21:37,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:21:37,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:21:37,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:21:37,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:21:37,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:21:37,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:21:37,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:21:37,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:21:37,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:21:37,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:21:37,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:21:37,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:21:37,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:21:37,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:21:37,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:21:37,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:21:37,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:21:37,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:21:37,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:21:37,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:21:37,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:21:37,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:21:37,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:21:37,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:21:37,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:21:37,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:21:37,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:21:37,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:21:37,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:21:37,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:21:37,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:21:37,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:21:37,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:21:37,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:21:37,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:21:37,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:21:37,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:21:37,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:21:37,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:21:37,195 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 11:21:37,226 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:21:37,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:21:37,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:21:37,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:21:37,227 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:21:37,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:21:37,228 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:21:37,228 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:21:37,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:21:37,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:21:37,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:21:37,229 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 11:21:37,229 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 11:21:37,229 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 11:21:37,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:21:37,230 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:21:37,230 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:21:37,230 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:21:37,231 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:21:37,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:21:37,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:21:37,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:21:37,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:21:37,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:21:37,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:21:37,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:21:37,232 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:21:37,233 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:21:37,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:21:37,233 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_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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 -> 50623fcce85e4b85b0accc998d09712632377f90 [2019-11-20 11:21:37,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:21:37,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:21:37,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:21:37,422 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:21:37,423 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:21:37,423 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2019-11-20 11:21:37,488 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/data/b65aabf23/5864e451b50d4d359aa75d74fa0d879c/FLAG146f0d906 [2019-11-20 11:21:38,073 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:21:38,074 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2019-11-20 11:21:38,100 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/data/b65aabf23/5864e451b50d4d359aa75d74fa0d879c/FLAG146f0d906 [2019-11-20 11:21:38,353 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/data/b65aabf23/5864e451b50d4d359aa75d74fa0d879c [2019-11-20 11:21:38,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:21:38,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 11:21:38,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:21:38,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:21:38,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:21:38,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:21:38" (1/1) ... [2019-11-20 11:21:38,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd3a192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:38, skipping insertion in model container [2019-11-20 11:21:38,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:21:38" (1/1) ... [2019-11-20 11:21:38,388 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:21:38,447 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:21:38,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:21:38,943 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:21:39,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:21:39,113 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:21:39,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39 WrapperNode [2019-11-20 11:21:39,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:21:39,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:21:39,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:21:39,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:21:39,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (1/1) ... [2019-11-20 11:21:39,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (1/1) ... [2019-11-20 11:21:39,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (1/1) ... [2019-11-20 11:21:39,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (1/1) ... [2019-11-20 11:21:39,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (1/1) ... [2019-11-20 11:21:39,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (1/1) ... [2019-11-20 11:21:39,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (1/1) ... [2019-11-20 11:21:39,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:21:39,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:21:39,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:21:39,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:21:39,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:21:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 11:21:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:21:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-20 11:21:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 11:21:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 11:21:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 11:21:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 11:21:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 11:21:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-20 11:21:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-20 11:21:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-20 11:21:39,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-20 11:21:39,305 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-20 11:21:39,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-20 11:21:39,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-20 11:21:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-20 11:21:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-20 11:21:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-20 11:21:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-20 11:21:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-20 11:21:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-20 11:21:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-20 11:21:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-20 11:21:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-20 11:21:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-20 11:21:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-20 11:21:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-20 11:21:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-20 11:21:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-20 11:21:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-20 11:21:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-20 11:21:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-20 11:21:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-20 11:21:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-20 11:21:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-20 11:21:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-20 11:21:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-20 11:21:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-20 11:21:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-20 11:21:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-20 11:21:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-20 11:21:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-11-20 11:21:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2019-11-20 11:21:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-20 11:21:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 11:21:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-20 11:21:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-20 11:21:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-20 11:21:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 11:21:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 11:21:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 11:21:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 11:21:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 11:21:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 11:21:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 11:21:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 11:21:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 11:21:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 11:21:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 11:21:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 11:21:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 11:21:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 11:21:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 11:21:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 11:21:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 11:21:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 11:21:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 11:21:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 11:21:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 11:21:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 11:21:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 11:21:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 11:21:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 11:21:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 11:21:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 11:21:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 11:21:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 11:21:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 11:21:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 11:21:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 11:21:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 11:21:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 11:21:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 11:21:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 11:21:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 11:21:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 11:21:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 11:21:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 11:21:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 11:21:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 11:21:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 11:21:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 11:21:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 11:21:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 11:21:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 11:21:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 11:21:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 11:21:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 11:21:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 11:21:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 11:21:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 11:21:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 11:21:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 11:21:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 11:21:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 11:21:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 11:21:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 11:21:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 11:21:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 11:21:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 11:21:39,328 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 11:21:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 11:21:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 11:21:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 11:21:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 11:21:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 11:21:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 11:21:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 11:21:39,331 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 11:21:39,331 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 11:21:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 11:21:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 11:21:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 11:21:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 11:21:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 11:21:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 11:21:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 11:21:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 11:21:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 11:21:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 11:21:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 11:21:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 11:21:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 11:21:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 11:21:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 11:21:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 11:21:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 11:21:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 11:21:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 11:21:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 11:21:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 11:21:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 11:21:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 11:21:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 11:21:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 11:21:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 11:21:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 11:21:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 11:21:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 11:21:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 11:21:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 11:21:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 11:21:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 11:21:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 11:21:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 11:21:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 11:21:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 11:21:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-20 11:21:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-20 11:21:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-20 11:21:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-20 11:21:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-20 11:21:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-20 11:21:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:21:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-20 11:21:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-20 11:21:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-20 11:21:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:21:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-20 11:21:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-20 11:21:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-20 11:21:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:21:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-20 11:21:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-20 11:21:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-20 11:21:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-20 11:21:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-20 11:21:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-20 11:21:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:21:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-20 11:21:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-20 11:21:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-20 11:21:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-20 11:21:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-20 11:21:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 11:21:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 11:21:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-20 11:21:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-20 11:21:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-20 11:21:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-20 11:21:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-20 11:21:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-20 11:21:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-20 11:21:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-20 11:21:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-20 11:21:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-20 11:21:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-20 11:21:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-20 11:21:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-20 11:21:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-20 11:21:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-20 11:21:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-20 11:21:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-20 11:21:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-11-20 11:21:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2019-11-20 11:21:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-20 11:21:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 11:21:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 11:21:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:21:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 11:21:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:21:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-20 11:21:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-20 11:21:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-20 11:21:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-20 11:21:40,193 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 11:21:40,681 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 11:21:41,207 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:21:41,213 INFO L285 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-20 11:21:41,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:21:41 BoogieIcfgContainer [2019-11-20 11:21:41,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:21:41,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:21:41,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:21:41,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:21:41,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:21:38" (1/3) ... [2019-11-20 11:21:41,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6c3aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:21:41, skipping insertion in model container [2019-11-20 11:21:41,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:39" (2/3) ... [2019-11-20 11:21:41,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6c3aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:21:41, skipping insertion in model container [2019-11-20 11:21:41,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:21:41" (3/3) ... [2019-11-20 11:21:41,227 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2019-11-20 11:21:41,238 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:21:41,249 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-11-20 11:21:41,261 INFO L249 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-11-20 11:21:41,293 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:21:41,293 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 11:21:41,293 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:21:41,293 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:21:41,293 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:21:41,294 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:21:41,294 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:21:41,294 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:21:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-20 11:21:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 11:21:41,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:41,342 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:21:41,343 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:21:41,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash 797453636, now seen corresponding path program 1 times [2019-11-20 11:21:41,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:21:41,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [665538242] [2019-11-20 11:21:41,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:21:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:41,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 11:21:41,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:42,012 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:21:42,013 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:21:42,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:42,091 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2019-11-20 11:21:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:21:42,097 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:21:42,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:32 [2019-11-20 11:21:42,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:21:42,154 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:21:42,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:42,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:42,159 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:21:42,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-20 11:21:42,182 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:21:42,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:42,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:42,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:42,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-20 11:21:42,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:42,289 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:21:42,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:42,322 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 11:21:42,323 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:21:42,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-20 11:21:42,475 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:21:42,475 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:21:42,966 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:21:42,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [665538242] [2019-11-20 11:21:42,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:21:42,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-20 11:21:42,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489728425] [2019-11-20 11:21:42,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 11:21:42,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:21:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 11:21:42,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:21:42,999 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 14 states. [2019-11-20 11:21:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:21:57,603 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2019-11-20 11:21:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:21:57,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-20 11:21:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:21:57,619 INFO L225 Difference]: With dead ends: 208 [2019-11-20 11:21:57,620 INFO L226 Difference]: Without dead ends: 195 [2019-11-20 11:21:57,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-11-20 11:21:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-20 11:21:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 109. [2019-11-20 11:21:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 11:21:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-20 11:21:57,688 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 17 [2019-11-20 11:21:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:21:57,688 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-20 11:21:57,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 11:21:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-20 11:21:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 11:21:57,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:21:57,689 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:21:57,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:21:57,891 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:21:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:21:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 797453637, now seen corresponding path program 1 times [2019-11-20 11:21:57,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:21:57,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2054191550] [2019-11-20 11:21:57,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:21:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:58,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 11:21:58,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:21:58,287 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 11:21:58,288 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:21:58,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,374 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:21:58,374 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:21:58,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,431 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-20 11:21:58,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:21:58,434 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:21:58,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:45 [2019-11-20 11:21:58,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:21:58,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:21:58,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:21:58,521 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:21:58,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,528 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:21:58,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,534 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 11:21:58,534 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,600 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:21:58,601 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:126, output treesize:66 [2019-11-20 11:21:58,750 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:21:58,765 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:21:58,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,845 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:21:58,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:21:58,925 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:21:58,926 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,959 INFO L567 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-11-20 11:21:58,959 INFO L464 ElimStorePlain]: Eliminatee |v_#valid_BEFORE_CALL_10| vanished before elimination [2019-11-20 11:21:58,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:21:58,960 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:10 [2019-11-20 11:22:01,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:22:01,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:22:01,054 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:22:01,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:22:01,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:22:01,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:22:01,177 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:22:01,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:22:01,345 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-20 11:22:01,347 INFO L567 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size [2019-11-20 11:22:01,366 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:22:01,366 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:22:01,367 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:22:01,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:22:01,416 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:22:01,417 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:22:01,464 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-20 11:22:01,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:22:01,465 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:9 [2019-11-20 11:22:01,546 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:22:01,546 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:22:01,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:22:02,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:22:03,173 WARN L191 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-20 11:22:03,188 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 39 [2019-11-20 11:22:03,981 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-20 11:22:04,877 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:22:04,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2054191550] [2019-11-20 11:22:04,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:22:04,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 11:22:04,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819816050] [2019-11-20 11:22:04,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 11:22:04,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:22:04,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 11:22:04,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=185, Unknown=1, NotChecked=0, Total=240 [2019-11-20 11:22:04,882 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 16 states. [2019-11-20 11:22:22,251 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-11-20 11:23:38,589 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-20 11:23:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:23:47,093 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2019-11-20 11:23:47,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 11:23:47,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-11-20 11:23:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:23:47,097 INFO L225 Difference]: With dead ends: 197 [2019-11-20 11:23:47,097 INFO L226 Difference]: Without dead ends: 197 [2019-11-20 11:23:47,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=215, Invalid=537, Unknown=4, NotChecked=0, Total=756 [2019-11-20 11:23:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-20 11:23:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 107. [2019-11-20 11:23:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 11:23:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-20 11:23:47,117 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2019-11-20 11:23:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:23:47,117 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-20 11:23:47,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 11:23:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-20 11:23:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 11:23:47,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:23:47,119 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:23:47,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:23:47,320 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:23:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:23:47,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1477528223, now seen corresponding path program 1 times [2019-11-20 11:23:47,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:23:47,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [945282738] [2019-11-20 11:23:47,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:23:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:23:47,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 11:23:47,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:23:47,651 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:23:47,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:47,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:47,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:23:47,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2019-11-20 11:23:47,733 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:23:47,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:47,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:47,746 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:23:47,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-11-20 11:23:47,810 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:23:47,810 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:23:47,820 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:47,821 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:23:47,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:23:47,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:47,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:47,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:23:47,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-20 11:23:47,942 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:23:47,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [945282738] [2019-11-20 11:23:47,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:23:47,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2019-11-20 11:23:47,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497128117] [2019-11-20 11:23:47,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:23:47,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:23:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:23:47,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:23:47,944 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 12 states. [2019-11-20 11:23:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:23:48,997 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2019-11-20 11:23:48,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:23:49,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-20 11:23:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:23:49,002 INFO L225 Difference]: With dead ends: 150 [2019-11-20 11:23:49,002 INFO L226 Difference]: Without dead ends: 150 [2019-11-20 11:23:49,003 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:23:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-20 11:23:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 106. [2019-11-20 11:23:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 11:23:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-20 11:23:49,017 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 20 [2019-11-20 11:23:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:23:49,018 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-20 11:23:49,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:23:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-20 11:23:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 11:23:49,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:23:49,019 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:23:49,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:23:49,223 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:23:49,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:23:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1477528224, now seen corresponding path program 1 times [2019-11-20 11:23:49,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:23:49,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1995307804] [2019-11-20 11:23:49,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:23:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:23:49,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-20 11:23:49,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:23:49,565 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 11:23:49,566 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:23:49,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:49,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:49,680 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:23:49,680 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:23:49,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:49,754 INFO L567 ElimStorePlain]: treesize reduction 10, result has 87.2 percent of original size [2019-11-20 11:23:49,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:49,756 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:23:49,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:68 [2019-11-20 11:23:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:49,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:49,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:49,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:49,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:49,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:49,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:49,975 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:23:49,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:49,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:49,991 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:23:49,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:49,996 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 11:23:49,996 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:50,181 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-20 11:23:50,181 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.0 percent of original size [2019-11-20 11:23:50,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:50,198 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:23:50,199 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:50,202 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 11:23:50,203 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:50,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:50,223 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:23:50,223 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:211, output treesize:42 [2019-11-20 11:23:52,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:52,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:52,381 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:23:52,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:52,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:23:52,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:23:52,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:52,406 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:23:52,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:52,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:52,468 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:23:52,469 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:52,740 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-20 11:23:52,740 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.9 percent of original size [2019-11-20 11:23:52,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:52,772 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:23:52,772 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:52,798 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:52,798 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:23:52,799 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:53,001 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-20 11:23:53,002 INFO L567 ElimStorePlain]: treesize reduction 10, result has 92.4 percent of original size [2019-11-20 11:23:53,003 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:23:53,003 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:224, output treesize:95 [2019-11-20 11:23:53,218 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:23:53,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:53,264 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.5 percent of original size [2019-11-20 11:23:53,274 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:23:53,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:23:53,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:23:53,294 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:23:53,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:9 [2019-11-20 11:23:53,497 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:23:53,497 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:23:54,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:54,710 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 11:23:57,240 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 11:23:57,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:23:57,273 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-20 11:24:00,646 WARN L191 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-20 11:24:00,667 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-20 11:24:04,813 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-20 11:24:09,642 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:24:09,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1995307804] [2019-11-20 11:24:09,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:24:09,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 20 [2019-11-20 11:24:09,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789871628] [2019-11-20 11:24:09,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 11:24:09,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:24:09,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 11:24:09,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=359, Unknown=2, NotChecked=0, Total=420 [2019-11-20 11:24:09,643 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 21 states. [2019-11-20 11:24:25,152 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 11:24:25,436 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-20 11:24:32,427 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 11:24:36,255 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-11-20 11:24:58,511 WARN L191 SmtUtils]: Spent 7.27 s on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-11-20 11:25:03,848 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2019-11-20 11:25:25,466 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 11:25:47,524 WARN L191 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-11-20 11:26:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:15,811 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2019-11-20 11:26:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 11:26:15,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-11-20 11:26:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:15,815 INFO L225 Difference]: With dead ends: 151 [2019-11-20 11:26:15,815 INFO L226 Difference]: Without dead ends: 151 [2019-11-20 11:26:15,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=263, Invalid=995, Unknown=2, NotChecked=0, Total=1260 [2019-11-20 11:26:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-20 11:26:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2019-11-20 11:26:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-20 11:26:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-20 11:26:15,825 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2019-11-20 11:26:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:15,826 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-20 11:26:15,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 11:26:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-20 11:26:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:26:15,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:15,827 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:26:16,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:16,034 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1441265296, now seen corresponding path program 1 times [2019-11-20 11:26:16,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:16,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1331549900] [2019-11-20 11:26:16,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:16,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 11:26:16,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:16,284 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:26:16,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:16,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:16,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:16,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:26:16,339 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:26:16,339 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:16,456 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:26:16,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1331549900] [2019-11-20 11:26:16,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:16,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 13 [2019-11-20 11:26:16,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889773458] [2019-11-20 11:26:16,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 11:26:16,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 11:26:16,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:26:16,458 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 14 states. [2019-11-20 11:26:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:17,310 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-20 11:26:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:26:17,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-20 11:26:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:17,311 INFO L225 Difference]: With dead ends: 121 [2019-11-20 11:26:17,312 INFO L226 Difference]: Without dead ends: 121 [2019-11-20 11:26:17,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:26:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-20 11:26:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-11-20 11:26:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 11:26:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-11-20 11:26:17,333 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 21 [2019-11-20 11:26:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:17,334 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-11-20 11:26:17,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 11:26:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-11-20 11:26:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:26:17,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:17,337 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:26:17,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:17,549 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1441265295, now seen corresponding path program 1 times [2019-11-20 11:26:17,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:17,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [428292950] [2019-11-20 11:26:17,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:17,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 11:26:17,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:17,788 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:26:17,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:17,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:17,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:17,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:26:17,891 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:26:17,891 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:26:18,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [428292950] [2019-11-20 11:26:18,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:18,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-20 11:26:18,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141605017] [2019-11-20 11:26:18,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 11:26:18,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:18,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 11:26:18,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:26:18,764 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 18 states. [2019-11-20 11:26:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:20,589 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-11-20 11:26:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:26:20,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-20 11:26:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:20,591 INFO L225 Difference]: With dead ends: 119 [2019-11-20 11:26:20,591 INFO L226 Difference]: Without dead ends: 119 [2019-11-20 11:26:20,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-20 11:26:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-20 11:26:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-11-20 11:26:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 11:26:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-11-20 11:26:20,599 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 21 [2019-11-20 11:26:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:20,599 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-11-20 11:26:20,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 11:26:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-11-20 11:26:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:26:20,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:20,600 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:26:20,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:20,801 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1312182577, now seen corresponding path program 1 times [2019-11-20 11:26:20,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:20,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [168190906] [2019-11-20 11:26:20,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:21,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:26:21,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:21,083 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:26:21,084 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:21,126 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:26:21,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [168190906] [2019-11-20 11:26:21,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:21,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 11:26:21,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110409165] [2019-11-20 11:26:21,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:26:21,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:26:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:26:21,128 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 5 states. [2019-11-20 11:26:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:21,149 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-11-20 11:26:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:26:21,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 11:26:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:21,151 INFO L225 Difference]: With dead ends: 102 [2019-11-20 11:26:21,151 INFO L226 Difference]: Without dead ends: 102 [2019-11-20 11:26:21,152 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:26:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-20 11:26:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-20 11:26:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 11:26:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-20 11:26:21,163 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 21 [2019-11-20 11:26:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:21,165 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-20 11:26:21,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:26:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-20 11:26:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:26:21,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:21,169 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:26:21,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:21,374 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1200287389, now seen corresponding path program 1 times [2019-11-20 11:26:21,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:21,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1900106098] [2019-11-20 11:26:21,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:21,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:26:21,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:21,609 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:26:21,609 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:21,657 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:26:21,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1900106098] [2019-11-20 11:26:21,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:21,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 11:26:21,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802644276] [2019-11-20 11:26:21,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:26:21,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:26:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:26:21,658 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2019-11-20 11:26:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:21,677 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-11-20 11:26:21,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:26:21,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 11:26:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:21,679 INFO L225 Difference]: With dead ends: 100 [2019-11-20 11:26:21,679 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 11:26:21,679 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:26:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 11:26:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-20 11:26:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 11:26:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-11-20 11:26:21,684 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 21 [2019-11-20 11:26:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:21,684 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-11-20 11:26:21,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:26:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-11-20 11:26:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:26:21,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:21,692 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:26:21,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:21,899 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:21,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1071204670, now seen corresponding path program 1 times [2019-11-20 11:26:21,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:21,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1782677785] [2019-11-20 11:26:21,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:22,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 11:26:22,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:22,142 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:26:22,143 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:26:22,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,182 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-11-20 11:26:22,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:22,182 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:26:22,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:39 [2019-11-20 11:26:22,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:22,212 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:26:22,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:22,232 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 11:26:22,232 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 7 [2019-11-20 11:26:22,233 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:22,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2019-11-20 11:26:22,270 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 11:26:22,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 10 [2019-11-20 11:26:22,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,282 INFO L567 ElimStorePlain]: treesize reduction 5, result has 68.8 percent of original size [2019-11-20 11:26:22,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2019-11-20 11:26:22,310 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:26:22,310 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:22,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:22,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:22,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:22,467 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 38 treesize of output 32 [2019-11-20 11:26:22,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,472 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 35 treesize of output 29 [2019-11-20 11:26:22,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,476 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 11:26:22,476 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,479 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 11:26:22,479 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:22,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:22,508 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_2| vanished before elimination [2019-11-20 11:26:22,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 11:26:22,508 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:54 [2019-11-20 11:26:22,628 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:26:22,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1782677785] [2019-11-20 11:26:22,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:22,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-20 11:26:22,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133368422] [2019-11-20 11:26:22,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:26:22,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:22,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:26:22,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:26:22,630 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 10 states. [2019-11-20 11:26:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:23,565 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-20 11:26:23,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:26:23,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-20 11:26:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:23,568 INFO L225 Difference]: With dead ends: 137 [2019-11-20 11:26:23,568 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 11:26:23,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-11-20 11:26:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 11:26:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-11-20 11:26:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-20 11:26:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-20 11:26:23,574 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2019-11-20 11:26:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:23,574 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-20 11:26:23,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:26:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-11-20 11:26:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:26:23,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:23,575 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:26:23,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:23,776 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1071204669, now seen corresponding path program 1 times [2019-11-20 11:26:23,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:23,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [818259653] [2019-11-20 11:26:23,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:23,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 11:26:24,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:24,014 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 11:26:24,014 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:26:24,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:24,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,028 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:26:24,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-11-20 11:26:24,063 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:26:24,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:24,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,080 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_7|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_17|]} [2019-11-20 11:26:24,083 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 7 treesize of output 3 [2019-11-20 11:26:24,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:24,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:24,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,101 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:26:24,101 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:24,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:24,109 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:13 [2019-11-20 11:26:24,137 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:26:24,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:24,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,148 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 15 treesize of output 7 [2019-11-20 11:26:24,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:24,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,155 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:26:24,155 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:9 [2019-11-20 11:26:24,181 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:26:24,181 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:24,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:26:24,519 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 16 treesize of output 10 [2019-11-20 11:26:24,520 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:26:24,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,561 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4| vanished before elimination [2019-11-20 11:26:24,572 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 33 treesize of output 17 [2019-11-20 11:26:24,573 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:26:24,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:24,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:24,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:54 [2019-11-20 11:26:24,776 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:26:24,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [818259653] [2019-11-20 11:26:24,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:24,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 11:26:24,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204396011] [2019-11-20 11:26:24,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:26:24,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:26:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:26:24,778 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 12 states. [2019-11-20 11:26:26,472 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 11:26:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:27,559 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-11-20 11:26:27,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 11:26:27,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-20 11:26:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:27,561 INFO L225 Difference]: With dead ends: 145 [2019-11-20 11:26:27,561 INFO L226 Difference]: Without dead ends: 145 [2019-11-20 11:26:27,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-11-20 11:26:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-20 11:26:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2019-11-20 11:26:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-20 11:26:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2019-11-20 11:26:27,567 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 21 [2019-11-20 11:26:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:27,567 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2019-11-20 11:26:27,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:26:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2019-11-20 11:26:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 11:26:27,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:27,568 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:26:27,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:27,772 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478541, now seen corresponding path program 1 times [2019-11-20 11:26:27,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:27,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1877368083] [2019-11-20 11:26:27,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:28,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:26:28,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:28,041 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:26:28,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:28,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:28,043 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:26:28,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2019-11-20 11:26:28,064 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:26:28,064 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:28,091 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:26:28,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1877368083] [2019-11-20 11:26:28,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:28,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-20 11:26:28,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932654493] [2019-11-20 11:26:28,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:26:28,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:26:28,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:26:28,093 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 6 states. [2019-11-20 11:26:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:28,687 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2019-11-20 11:26:28,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 11:26:28,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-20 11:26:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:28,689 INFO L225 Difference]: With dead ends: 136 [2019-11-20 11:26:28,689 INFO L226 Difference]: Without dead ends: 136 [2019-11-20 11:26:28,690 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:26:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-20 11:26:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2019-11-20 11:26:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-20 11:26:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2019-11-20 11:26:28,695 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 23 [2019-11-20 11:26:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:28,695 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2019-11-20 11:26:28,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:26:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2019-11-20 11:26:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 11:26:28,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:28,696 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:26:28,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:28,900 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478540, now seen corresponding path program 1 times [2019-11-20 11:26:28,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:28,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1768127921] [2019-11-20 11:26:28,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:29,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 11:26:29,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:29,281 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:26:29,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:29,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:29,303 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:26:29,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:29,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:29,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:29,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:10 [2019-11-20 11:26:29,448 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:26:29,448 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:29,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:29,562 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:26:29,562 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:26:29,589 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:26:29,590 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:26:29,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:29,612 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:26:29,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:29,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:29,614 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:26:29,769 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:26:29,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:29,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:29,770 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:26:29,771 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:85 [2019-11-20 11:26:29,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:30,023 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-20 11:26:30,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:30,352 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-20 11:26:30,581 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 11:26:30,788 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 11:26:31,386 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:26:31,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1768127921] [2019-11-20 11:26:31,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:31,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 11:26:31,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003735064] [2019-11-20 11:26:31,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 11:26:31,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 11:26:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:26:31,390 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 16 states. [2019-11-20 11:26:32,403 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 11:26:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:33,637 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2019-11-20 11:26:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:26:33,639 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 11:26:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:33,640 INFO L225 Difference]: With dead ends: 135 [2019-11-20 11:26:33,640 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 11:26:33,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-11-20 11:26:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 11:26:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2019-11-20 11:26:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-20 11:26:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2019-11-20 11:26:33,644 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 23 [2019-11-20 11:26:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:33,645 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2019-11-20 11:26:33,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 11:26:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2019-11-20 11:26:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 11:26:33,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:33,646 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] [2019-11-20 11:26:33,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:33,849 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1455614589, now seen corresponding path program 1 times [2019-11-20 11:26:33,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:33,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [88172418] [2019-11-20 11:26:33,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/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:26:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:34,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 11:26:34,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:34,103 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:26:34,103 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:26:34,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,154 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-11-20 11:26:34,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:34,155 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:26:34,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:39 [2019-11-20 11:26:34,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:34,194 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:26:34,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:34,216 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 11:26:34,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 7 [2019-11-20 11:26:34,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:34,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2019-11-20 11:26:34,244 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 11:26:34,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 10 [2019-11-20 11:26:34,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,253 INFO L567 ElimStorePlain]: treesize reduction 5, result has 68.8 percent of original size [2019-11-20 11:26:34,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2019-11-20 11:26:34,320 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:26:34,320 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:34,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:34,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:34,485 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 38 treesize of output 32 [2019-11-20 11:26:34,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,493 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 35 treesize of output 29 [2019-11-20 11:26:34,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,498 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 11:26:34,498 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,501 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 11:26:34,501 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:34,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:34,525 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_6| vanished before elimination [2019-11-20 11:26:34,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 11:26:34,525 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:54 [2019-11-20 11:26:34,644 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:26:34,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [88172418] [2019-11-20 11:26:34,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:34,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-20 11:26:34,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691186429] [2019-11-20 11:26:34,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:26:34,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:26:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:26:34,646 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 12 states. [2019-11-20 11:26:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:35,869 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2019-11-20 11:26:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 11:26:35,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-20 11:26:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:35,871 INFO L225 Difference]: With dead ends: 145 [2019-11-20 11:26:35,871 INFO L226 Difference]: Without dead ends: 145 [2019-11-20 11:26:35,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-11-20 11:26:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-20 11:26:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2019-11-20 11:26:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-20 11:26:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2019-11-20 11:26:35,876 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 26 [2019-11-20 11:26:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:35,876 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2019-11-20 11:26:35,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:26:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2019-11-20 11:26:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 11:26:35,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:35,877 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] [2019-11-20 11:26:36,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:36,078 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1455614590, now seen corresponding path program 1 times [2019-11-20 11:26:36,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:36,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [193172303] [2019-11-20 11:26:36,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:36,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 11:26:36,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:36,314 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_17|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_33|]} [2019-11-20 11:26:36,317 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 7 treesize of output 3 [2019-11-20 11:26:36,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:36,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:36,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:36,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:36,333 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:26:36,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:36,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:36,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:36,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2019-11-20 11:26:36,365 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-20 11:26:36,368 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 15 treesize of output 7 [2019-11-20 11:26:36,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:36,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:36,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:36,383 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:36,383 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 24 treesize of output 10 [2019-11-20 11:26:36,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:36,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:36,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:36,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:10 [2019-11-20 11:26:36,418 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:26:36,418 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:36,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:36,571 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:26:36,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [193172303] [2019-11-20 11:26:36,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:36,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-20 11:26:36,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567604789] [2019-11-20 11:26:36,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 11:26:36,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 11:26:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 11:26:36,574 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand 11 states. [2019-11-20 11:26:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:37,230 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-11-20 11:26:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:26:37,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-11-20 11:26:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:37,231 INFO L225 Difference]: With dead ends: 123 [2019-11-20 11:26:37,231 INFO L226 Difference]: Without dead ends: 123 [2019-11-20 11:26:37,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:26:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-20 11:26:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-11-20 11:26:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 11:26:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-11-20 11:26:37,236 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 26 [2019-11-20 11:26:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:37,236 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-11-20 11:26:37,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 11:26:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-11-20 11:26:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 11:26:37,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:37,237 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] [2019-11-20 11:26:37,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:37,440 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1439813039, now seen corresponding path program 1 times [2019-11-20 11:26:37,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:37,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2003946544] [2019-11-20 11:26:37,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:37,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 11:26:37,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:37,719 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:26:37,719 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:26:37,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:37,758 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-11-20 11:26:37,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:37,758 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:26:37,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:39 [2019-11-20 11:26:37,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:37,793 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:26:37,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:37,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:37,814 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 11:26:37,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 7 [2019-11-20 11:26:37,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:37,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:37,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:37,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2019-11-20 11:26:37,850 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:26:37,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:37,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:37,864 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 11:26:37,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 7 [2019-11-20 11:26:37,865 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:37,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:37,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:37,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2019-11-20 11:26:37,927 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 11:26:37,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 7 [2019-11-20 11:26:37,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:37,931 INFO L567 ElimStorePlain]: treesize reduction 8, result has 38.5 percent of original size [2019-11-20 11:26:37,932 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:26:37,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:5 [2019-11-20 11:26:37,961 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:26:37,961 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:38,154 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:26:38,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2003946544] [2019-11-20 11:26:38,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:38,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 6] imperfect sequences [] total 12 [2019-11-20 11:26:38,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549730602] [2019-11-20 11:26:38,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 11:26:38,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:38,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 11:26:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 11:26:38,155 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 13 states. [2019-11-20 11:26:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:39,487 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-11-20 11:26:39,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 11:26:39,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-20 11:26:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:39,489 INFO L225 Difference]: With dead ends: 145 [2019-11-20 11:26:39,489 INFO L226 Difference]: Without dead ends: 145 [2019-11-20 11:26:39,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2019-11-20 11:26:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-20 11:26:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2019-11-20 11:26:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 11:26:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-11-20 11:26:39,494 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 28 [2019-11-20 11:26:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:39,494 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-11-20 11:26:39,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 11:26:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-11-20 11:26:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 11:26:39,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:39,495 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] [2019-11-20 11:26:39,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:39,696 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:39,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1439813038, now seen corresponding path program 1 times [2019-11-20 11:26:39,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:39,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [876489522] [2019-11-20 11:26:39,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:39,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 11:26:39,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:39,958 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 11:26:39,959 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:26:39,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:39,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:39,976 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:26:39,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:30 [2019-11-20 11:26:40,013 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:26:40,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:40,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:40,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:40,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:40,037 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:26:40,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:40,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:40,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:40,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2019-11-20 11:26:40,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:40,071 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:26:40,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:40,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:40,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:40,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-11-20 11:26:40,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:40,179 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:26:40,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:40,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:40,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:40,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-11-20 11:26:40,262 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:26:40,262 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:41,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:41,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:41,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:41,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:41,136 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 42 treesize of output 40 [2019-11-20 11:26:41,136 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:26:41,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:41,219 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 41 treesize of output 37 [2019-11-20 11:26:41,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:41,289 INFO L567 ElimStorePlain]: treesize reduction 41, result has 45.3 percent of original size [2019-11-20 11:26:41,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:41,290 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:34 [2019-11-20 11:26:41,454 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:26:41,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [876489522] [2019-11-20 11:26:41,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:41,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 21 [2019-11-20 11:26:41,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213303183] [2019-11-20 11:26:41,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 11:26:41,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 11:26:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 11:26:41,455 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 22 states. [2019-11-20 11:26:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:43,719 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-20 11:26:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 11:26:43,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-11-20 11:26:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:43,721 INFO L225 Difference]: With dead ends: 128 [2019-11-20 11:26:43,721 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 11:26:43,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2019-11-20 11:26:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 11:26:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-20 11:26:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 11:26:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-11-20 11:26:43,725 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 28 [2019-11-20 11:26:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:43,725 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-11-20 11:26:43,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 11:26:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-11-20 11:26:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 11:26:43,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:43,726 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, 1, 1] [2019-11-20 11:26:43,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:43,927 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:43,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:43,927 INFO L82 PathProgramCache]: Analyzing trace with hash -540919935, now seen corresponding path program 1 times [2019-11-20 11:26:43,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:43,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1467807363] [2019-11-20 11:26:43,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:44,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 11:26:44,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:44,248 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:26:44,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:44,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:44,258 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:26:44,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:44,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:44,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:44,260 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 11:26:44,269 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:26:44,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:44,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:44,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:44,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:26:44,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-20 11:26:44,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:44,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:44,451 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 1 xjuncts. [2019-11-20 11:26:44,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-11-20 11:26:44,636 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 17 treesize of output 9 [2019-11-20 11:26:44,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:44,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:44,642 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 1 xjuncts. [2019-11-20 11:26:44,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2019-11-20 11:26:44,690 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:26:44,691 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:45,466 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 51 treesize of output 47 [2019-11-20 11:26:45,467 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:26:45,476 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 50 treesize of output 46 [2019-11-20 11:26:45,476 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:26:45,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:45,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 11:26:45,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:94 [2019-11-20 11:26:45,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:26:45,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:45,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-20 11:26:45,758 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 32 treesize of output 28 [2019-11-20 11:26:45,758 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:26:45,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:45,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:26:45,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:42 [2019-11-20 11:26:46,255 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-20 11:26:46,403 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:26:46,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1467807363] [2019-11-20 11:26:46,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:46,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 24 [2019-11-20 11:26:46,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118047798] [2019-11-20 11:26:46,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 11:26:46,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 11:26:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-20 11:26:46,404 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 25 states. [2019-11-20 11:26:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:26:49,238 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-11-20 11:26:49,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 11:26:49,238 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-11-20 11:26:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:26:49,239 INFO L225 Difference]: With dead ends: 119 [2019-11-20 11:26:49,239 INFO L226 Difference]: Without dead ends: 119 [2019-11-20 11:26:49,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 11:26:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-20 11:26:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-11-20 11:26:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 11:26:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-20 11:26:49,245 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 35 [2019-11-20 11:26:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:26:49,245 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-20 11:26:49,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 11:26:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-20 11:26:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 11:26:49,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:26:49,247 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, 1, 1] [2019-11-20 11:26:49,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:49,451 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:26:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:26:49,452 INFO L82 PathProgramCache]: Analyzing trace with hash -540919934, now seen corresponding path program 1 times [2019-11-20 11:26:49,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:26:49,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1592003261] [2019-11-20 11:26:49,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:26:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:49,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-20 11:26:49,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:49,830 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:26:49,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:49,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:49,839 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:26:49,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:49,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:49,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:49,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 11:26:49,861 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:26:49,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:49,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:49,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:26:49,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 11:26:50,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-20 11:26:50,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:50,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:50,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-20 11:26:50,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:50,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:50,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:26:50,084 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-11-20 11:26:50,260 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 17 treesize of output 9 [2019-11-20 11:26:50,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:50,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:50,274 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 15 treesize of output 7 [2019-11-20 11:26:50,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:50,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:50,281 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:26:50,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-20 11:26:50,338 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:26:50,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:26:50,983 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 11:26:51,308 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 11:26:52,472 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 54 treesize of output 50 [2019-11-20 11:26:52,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:52,687 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 11:26:52,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:52,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:52,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:52,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:52,884 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 11:26:52,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:52,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:52,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:52,893 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:53,039 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 11:26:53,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:53,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:53,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:53,048 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:53,179 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 11:26:53,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:53,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 11:26:53,180 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-20 11:26:53,523 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 11:26:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:26:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:26:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:26:54,186 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-20 11:26:54,218 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 86 treesize of output 82 [2019-11-20 11:26:54,219 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:26:54,601 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 11:26:54,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:54,630 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 54 treesize of output 50 [2019-11-20 11:26:54,633 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:55,082 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-11-20 11:26:55,083 INFO L567 ElimStorePlain]: treesize reduction 36, result has 79.5 percent of original size [2019-11-20 11:26:55,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:55,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:55,095 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:55,310 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 11:26:55,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:55,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:55,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:26:55,323 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:26:55,572 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 11:26:55,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:26:55,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 11:26:55,574 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-20 11:26:56,092 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 11:26:56,708 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:26:56,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1592003261] [2019-11-20 11:26:56,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:26:56,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 26 [2019-11-20 11:26:56,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378359837] [2019-11-20 11:26:56,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 11:26:56,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:56,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 11:26:56,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-20 11:26:56,710 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 27 states. [2019-11-20 11:27:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:27:02,549 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-11-20 11:27:02,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 11:27:02,550 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-11-20 11:27:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:27:02,551 INFO L225 Difference]: With dead ends: 105 [2019-11-20 11:27:02,551 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 11:27:02,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 11:27:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 11:27:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2019-11-20 11:27:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 11:27:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-11-20 11:27:02,557 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 35 [2019-11-20 11:27:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:27:02,557 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-11-20 11:27:02,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 11:27:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-11-20 11:27:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 11:27:02,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:27:02,558 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:27:02,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:27:02,759 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:27:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:27:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1917126943, now seen corresponding path program 1 times [2019-11-20 11:27:02,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:27:02,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [768950833] [2019-11-20 11:27:02,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:27:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:27:03,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-20 11:27:03,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:27:03,132 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:27:03,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:03,141 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:27:03,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:03,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 11:27:03,161 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:27:03,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:03,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 11:27:03,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-20 11:27:03,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:03,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-20 11:27:03,392 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:03,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:27:03,405 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-11-20 11:27:03,549 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 17 treesize of output 9 [2019-11-20 11:27:03,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:03,559 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 15 treesize of output 7 [2019-11-20 11:27:03,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:03,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:03,565 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:27:03,565 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-20 11:27:03,704 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:27:03,705 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:27:04,984 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 11:27:05,898 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 11:27:06,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:06,100 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 87 treesize of output 83 [2019-11-20 11:27:06,101 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:27:06,122 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 106 treesize of output 102 [2019-11-20 11:27:06,123 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:27:07,071 WARN L191 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-11-20 11:27:07,071 INFO L567 ElimStorePlain]: treesize reduction 32, result has 92.6 percent of original size [2019-11-20 11:27:07,097 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 131 treesize of output 119 [2019-11-20 11:27:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:07,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,111 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:27:07,147 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 70 treesize of output 62 [2019-11-20 11:27:07,149 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:07,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:07,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:07,165 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:07,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:07,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:07,183 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:07,218 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 73 treesize of output 65 [2019-11-20 11:27:07,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:07,222 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:07,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:07,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:07,241 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:07,870 WARN L191 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-11-20 11:27:07,870 INFO L567 ElimStorePlain]: treesize reduction 140, result has 61.4 percent of original size [2019-11-20 11:27:07,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-20 11:27:07,871 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:384, output treesize:222 [2019-11-20 11:27:08,525 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-20 11:27:08,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:08,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:08,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:08,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:08,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:08,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:08,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:08,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:08,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:27:08,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 11:27:08,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:08,616 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 11:27:09,961 WARN L191 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 45 [2019-11-20 11:27:10,008 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 106 treesize of output 102 [2019-11-20 11:27:10,008 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:27:10,667 WARN L191 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-20 11:27:10,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:10,730 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 101 treesize of output 93 [2019-11-20 11:27:10,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:10,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:10,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:10,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:10,733 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:27:11,468 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-20 11:27:11,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:11,505 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 127 treesize of output 119 [2019-11-20 11:27:11,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:11,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:11,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:11,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:11,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:11,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:11,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:11,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:11,509 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:27:13,023 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-11-20 11:27:13,023 INFO L567 ElimStorePlain]: treesize reduction 50, result has 88.5 percent of original size [2019-11-20 11:27:13,060 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 51 treesize of output 43 [2019-11-20 11:27:13,062 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:14,066 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-11-20 11:27:14,067 INFO L567 ElimStorePlain]: treesize reduction 46, result has 87.5 percent of original size [2019-11-20 11:27:14,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 70 treesize of output 62 [2019-11-20 11:27:14,098 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:14,687 WARN L191 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-11-20 11:27:14,688 INFO L567 ElimStorePlain]: treesize reduction 36, result has 88.2 percent of original size [2019-11-20 11:27:14,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:14,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:14,710 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:15,001 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 11:27:15,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:15,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:15,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:15,013 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:15,253 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 11:27:15,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:15,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:15,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:15,264 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:15,458 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 11:27:15,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:15,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-20 11:27:15,459 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:352, output treesize:198 [2019-11-20 11:27:15,849 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 11:27:16,543 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:27:16,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [768950833] [2019-11-20 11:27:16,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:27:16,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 15] imperfect sequences [] total 31 [2019-11-20 11:27:16,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370537876] [2019-11-20 11:27:16,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 11:27:16,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:27:16,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 11:27:16,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-11-20 11:27:16,545 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 32 states. [2019-11-20 11:27:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:27:23,810 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-11-20 11:27:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 11:27:23,812 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-20 11:27:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:27:23,812 INFO L225 Difference]: With dead ends: 103 [2019-11-20 11:27:23,812 INFO L226 Difference]: Without dead ends: 103 [2019-11-20 11:27:23,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2019-11-20 11:27:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-20 11:27:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-20 11:27:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 11:27:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-11-20 11:27:23,817 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 40 [2019-11-20 11:27:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:27:23,818 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-11-20 11:27:23,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 11:27:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-11-20 11:27:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 11:27:23,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:27:23,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:27:24,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:27:24,023 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 11:27:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:27:24,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1221359288, now seen corresponding path program 1 times [2019-11-20 11:27:24,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:27:24,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1228033277] [2019-11-20 11:27:24,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f632f9c-e65b-4dae-9f3d-8115d82b13bc/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:27:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:27:24,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-20 11:27:24,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:27:24,619 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 11:27:24,619 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:27:24,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:24,673 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.6 percent of original size [2019-11-20 11:27:24,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:24,674 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:27:24,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:51 [2019-11-20 11:27:24,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:27:24,714 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:27:24,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:24,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:24,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:27:24,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2019-11-20 11:27:24,753 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:27:24,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:24,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:24,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:24,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:24,781 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:27:24,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:24,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:24,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:27:24,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2019-11-20 11:27:25,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-20 11:27:25,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:25,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:25,141 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 1 xjuncts. [2019-11-20 11:27:25,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-20 11:27:25,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:25,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2019-11-20 11:27:25,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:25,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:25,260 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 1 xjuncts. [2019-11-20 11:27:25,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-20 11:27:25,361 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_275|], 6=[|v_#memory_$Pointer$.base_315|]} [2019-11-20 11:27:25,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-20 11:27:25,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:25,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:25,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:25,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:25,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 28 treesize of output 84 [2019-11-20 11:27:25,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:25,578 INFO L567 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-11-20 11:27:25,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:27:25,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2019-11-20 11:27:26,011 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-20 11:27:26,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:26,187 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:26,187 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 17 treesize of output 21 [2019-11-20 11:27:26,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:26,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:26,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:27:26,223 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 36 treesize of output 22 [2019-11-20 11:27:26,223 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:26,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:26,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:27:26,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:56 [2019-11-20 11:27:26,412 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 47 treesize of output 31 [2019-11-20 11:27:26,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:26,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:26,432 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 1 xjuncts. [2019-11-20 11:27:26,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:46 [2019-11-20 11:27:26,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:26,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 17 [2019-11-20 11:27:26,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:26,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:26,770 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:27:26,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:7 [2019-11-20 11:27:26,942 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:27:26,942 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:27:27,754 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 11:27:27,868 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 11:27:28,058 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 11:27:28,241 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 11:27:28,516 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 11:27:28,629 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 11:27:28,848 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 11:27:29,083 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 11:27:29,413 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-20 11:27:29,631 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 11:27:29,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:29,757 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 58 treesize of output 62 [2019-11-20 11:27:29,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:29,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:29,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:27:29,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:27:29,807 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-20 11:27:29,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:29,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:27:29,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2019-11-20 11:27:29,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:30,380 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 11:27:30,505 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 11:27:30,679 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 11:27:30,860 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 11:27:31,173 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 11:27:31,293 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 11:27:31,518 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 11:27:31,731 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 11:27:31,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:27:31,938 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:384) 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:27:31,945 INFO L168 Benchmark]: Toolchain (without parser) took 353586.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:31,946 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:27:31,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:31,954 INFO L168 Benchmark]: Boogie Preprocessor took 113.17 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:27:31,954 INFO L168 Benchmark]: RCFGBuilder took 1986.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:31,955 INFO L168 Benchmark]: TraceAbstraction took 350727.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -76.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:27:31,957 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 747.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.17 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 1986.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 350727.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -76.5 MB). There was no memory consumed. 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...