./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c7f8519a8c276dd62400de22bd8a8ed2f8e4176 --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-264dba8 [2019-11-21 13:20:13,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 13:20:13,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 13:20:13,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 13:20:13,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 13:20:13,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 13:20:13,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 13:20:13,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 13:20:13,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 13:20:13,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 13:20:13,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 13:20:13,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 13:20:13,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 13:20:13,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 13:20:13,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 13:20:13,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 13:20:13,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 13:20:13,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 13:20:13,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 13:20:13,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 13:20:13,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 13:20:13,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 13:20:13,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 13:20:13,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 13:20:13,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 13:20:13,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 13:20:13,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 13:20:13,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 13:20:13,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 13:20:13,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 13:20:13,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 13:20:13,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 13:20:13,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 13:20:13,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 13:20:13,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 13:20:13,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 13:20:13,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 13:20:13,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 13:20:13,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 13:20:13,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 13:20:13,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 13:20:13,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 13:20:13,445 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 13:20:13,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 13:20:13,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 13:20:13,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 13:20:13,448 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 13:20:13,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 13:20:13,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 13:20:13,449 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 13:20:13,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 13:20:13,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 13:20:13,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 13:20:13,450 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 13:20:13,451 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 13:20:13,451 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 13:20:13,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 13:20:13,452 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 13:20:13,452 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 13:20:13,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 13:20:13,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 13:20:13,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 13:20:13,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 13:20:13,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 13:20:13,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 13:20:13,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:20:13,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 13:20:13,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 13:20:13,454 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 13:20:13,455 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 13:20:13,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 13:20:13,455 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c7f8519a8c276dd62400de22bd8a8ed2f8e4176 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 13:20:13,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 13:20:13,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 13:20:13,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 13:20:13,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 13:20:13,784 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 13:20:13,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2019-11-21 13:20:13,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a2ee93d/73e7f94e74504879a8720078788bcdc3/FLAG23e992bed [2019-11-21 13:20:14,400 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 13:20:14,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2019-11-21 13:20:14,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a2ee93d/73e7f94e74504879a8720078788bcdc3/FLAG23e992bed [2019-11-21 13:20:14,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a2ee93d/73e7f94e74504879a8720078788bcdc3 [2019-11-21 13:20:14,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 13:20:14,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 13:20:14,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 13:20:14,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 13:20:14,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 13:20:14,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:20:14" (1/1) ... [2019-11-21 13:20:14,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7300d45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:14, skipping insertion in model container [2019-11-21 13:20:14,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:20:14" (1/1) ... [2019-11-21 13:20:14,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 13:20:14,719 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:20:15,120 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:20:15,121 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 13:20:15,121 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:20:15,133 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:20:15,133 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 13:20:15,134 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:20:15,136 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:20:15,137 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 13:20:15,137 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:20:15,140 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:20:15,141 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 13:20:15,141 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:20:15,186 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:20:15,186 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 13:20:15,187 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:20:15,205 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:20:15,206 INFO L969 CHandler]: at location: C: (struct A18 **)ldv_malloc(sizeof(struct A18*)*len) [763] [2019-11-21 13:20:15,206 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:20:15,210 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:20:15,211 INFO L969 CHandler]: at location: C: (struct A18 *)ldv_malloc(sizeof(struct A18)) [769] [2019-11-21 13:20:15,211 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:20:15,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:20:15,255 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 13:20:15,267 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:20:15,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:20:15,368 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 13:20:15,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:20:15,501 INFO L205 MainTranslator]: Completed translation [2019-11-21 13:20:15,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15 WrapperNode [2019-11-21 13:20:15,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 13:20:15,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 13:20:15,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 13:20:15,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 13:20:15,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (1/1) ... [2019-11-21 13:20:15,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (1/1) ... [2019-11-21 13:20:15,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (1/1) ... [2019-11-21 13:20:15,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (1/1) ... [2019-11-21 13:20:15,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (1/1) ... [2019-11-21 13:20:15,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (1/1) ... [2019-11-21 13:20:15,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (1/1) ... [2019-11-21 13:20:15,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 13:20:15,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 13:20:15,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 13:20:15,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 13:20:15,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:20:15,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 13:20:15,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 13:20:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 13:20:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 13:20:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 13:20:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 13:20:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 13:20:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 13:20:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 13:20:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 13:20:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 13:20:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 13:20:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 13:20:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 13:20:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 13:20:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 13:20:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 13:20:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 13:20:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 13:20:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 13:20:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 13:20:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 13:20:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 13:20:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 13:20:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 13:20:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 13:20:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 13:20:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 13:20:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 13:20:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 13:20:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 13:20:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 13:20:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 13:20:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 13:20:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 13:20:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 13:20:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 13:20:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 13:20:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 13:20:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 13:20:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 13:20:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 13:20:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 13:20:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 13:20:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 13:20:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 13:20:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 13:20:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 13:20:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 13:20:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 13:20:15,714 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 13:20:15,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 13:20:15,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 13:20:15,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 13:20:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 13:20:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 13:20:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 13:20:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 13:20:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 13:20:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 13:20:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 13:20:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 13:20:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 13:20:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 13:20:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 13:20:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 13:20:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 13:20:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 13:20:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 13:20:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 13:20:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 13:20:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 13:20:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 13:20:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 13:20:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 13:20:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 13:20:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 13:20:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 13:20:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 13:20:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 13:20:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 13:20:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 13:20:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 13:20:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 13:20:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 13:20:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 13:20:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 13:20:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 13:20:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 13:20:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 13:20:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 13:20:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 13:20:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 13:20:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 13:20:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 13:20:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 13:20:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 13:20:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 13:20:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 13:20:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 13:20:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 13:20:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 13:20:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 13:20:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 13:20:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 13:20:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 13:20:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 13:20:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 13:20:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 13:20:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 13:20:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 13:20:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 13:20:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 13:20:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 13:20:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 13:20:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 13:20:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 13:20:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 13:20:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 13:20:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 13:20:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 13:20:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 13:20:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 13:20:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 13:20:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 13:20:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 13:20:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 13:20:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 13:20:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 13:20:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 13:20:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 13:20:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 13:20:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 13:20:15,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 13:20:15,732 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 13:20:15,732 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 13:20:15,732 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 13:20:15,732 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 13:20:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 13:20:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 13:20:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 13:20:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 13:20:15,734 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 13:20:15,734 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 13:20:15,734 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 13:20:15,734 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 13:20:15,735 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 13:20:15,735 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 13:20:15,735 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 13:20:15,735 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 13:20:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 13:20:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 13:20:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 13:20:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 13:20:15,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 13:20:15,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 13:20:15,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 13:20:15,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 13:20:15,738 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 13:20:15,738 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 13:20:15,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 13:20:15,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 13:20:15,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 13:20:15,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 13:20:15,739 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 13:20:15,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 13:20:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 13:20:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 13:20:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 13:20:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 13:20:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 13:20:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 13:20:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 13:20:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 13:20:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 13:20:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 13:20:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 13:20:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 13:20:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 13:20:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 13:20:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 13:20:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 13:20:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 13:20:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 13:20:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 13:20:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 13:20:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 13:20:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 13:20:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 13:20:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 13:20:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 13:20:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 13:20:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 13:20:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 13:20:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 13:20:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 13:20:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 13:20:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 13:20:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 13:20:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 13:20:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 13:20:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 13:20:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 13:20:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 13:20:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 13:20:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 13:20:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 13:20:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 13:20:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 13:20:15,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 13:20:15,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 13:20:16,342 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 13:20:16,726 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 13:20:17,287 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 13:20:17,287 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 13:20:17,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:20:17 BoogieIcfgContainer [2019-11-21 13:20:17,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 13:20:17,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 13:20:17,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 13:20:17,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 13:20:17,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:20:14" (1/3) ... [2019-11-21 13:20:17,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5f8b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:20:17, skipping insertion in model container [2019-11-21 13:20:17,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:15" (2/3) ... [2019-11-21 13:20:17,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5f8b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:20:17, skipping insertion in model container [2019-11-21 13:20:17,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:20:17" (3/3) ... [2019-11-21 13:20:17,298 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test18.i [2019-11-21 13:20:17,308 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 13:20:17,316 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 81 error locations. [2019-11-21 13:20:17,328 INFO L249 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2019-11-21 13:20:17,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 13:20:17,350 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 13:20:17,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 13:20:17,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 13:20:17,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 13:20:17,350 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 13:20:17,351 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 13:20:17,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 13:20:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-11-21 13:20:17,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 13:20:17,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:20:17,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:20:17,382 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:20:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:20:17,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1935412654, now seen corresponding path program 1 times [2019-11-21 13:20:17,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:20:17,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1681480744] [2019-11-21 13:20:17,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:20:17,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:20:17,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:20:17,747 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-21 13:20:17,748 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:20:17,866 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-21 13:20:17,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1681480744] [2019-11-21 13:20:17,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:20:17,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 13:20:17,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403803005] [2019-11-21 13:20:17,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:20:17,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:20:17,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:20:17,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:20:17,904 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 5 states. [2019-11-21 13:20:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:20:18,108 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2019-11-21 13:20:18,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:20:18,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-21 13:20:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:20:18,124 INFO L225 Difference]: With dead ends: 78 [2019-11-21 13:20:18,124 INFO L226 Difference]: Without dead ends: 75 [2019-11-21 13:20:18,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-21 13:20:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-21 13:20:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 48. [2019-11-21 13:20:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-21 13:20:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-11-21 13:20:18,208 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 17 [2019-11-21 13:20:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:20:18,209 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-11-21 13:20:18,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:20:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-11-21 13:20:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 13:20:18,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:20:18,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:20:18,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:18,424 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:20:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:20:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash -616744307, now seen corresponding path program 1 times [2019-11-21 13:20:18,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:20:18,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1526937613] [2019-11-21 13:20:18,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:20:18,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 13:20:18,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:20:18,684 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-21 13:20:18,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:20:18,745 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-21 13:20:18,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1526937613] [2019-11-21 13:20:18,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:20:18,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 13:20:18,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049112142] [2019-11-21 13:20:18,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 13:20:18,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:20:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 13:20:18,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 13:20:18,749 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2019-11-21 13:20:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:20:18,888 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-11-21 13:20:18,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 13:20:18,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-21 13:20:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:20:18,890 INFO L225 Difference]: With dead ends: 76 [2019-11-21 13:20:18,891 INFO L226 Difference]: Without dead ends: 73 [2019-11-21 13:20:18,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 13:20:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-21 13:20:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-11-21 13:20:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-21 13:20:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-21 13:20:18,910 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2019-11-21 13:20:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:20:18,910 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-21 13:20:18,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 13:20:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-21 13:20:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 13:20:18,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:20:18,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:20:19,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:19,116 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:20:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:20:19,117 INFO L82 PathProgramCache]: Analyzing trace with hash -183177848, now seen corresponding path program 1 times [2019-11-21 13:20:19,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:20:19,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1988873272] [2019-11-21 13:20:19,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:20:19,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 13:20:19,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:20:19,427 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-21 13:20:19,427 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:20:19,488 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-21 13:20:19,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1988873272] [2019-11-21 13:20:19,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:20:19,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-21 13:20:19,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131166710] [2019-11-21 13:20:19,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 13:20:19,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:20:19,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 13:20:19,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-21 13:20:19,490 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2019-11-21 13:20:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:20:19,577 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-11-21 13:20:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:20:19,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-21 13:20:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:20:19,579 INFO L225 Difference]: With dead ends: 93 [2019-11-21 13:20:19,579 INFO L226 Difference]: Without dead ends: 93 [2019-11-21 13:20:19,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-21 13:20:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-21 13:20:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 51. [2019-11-21 13:20:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-21 13:20:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-21 13:20:19,587 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 18 [2019-11-21 13:20:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:20:19,588 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-21 13:20:19,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 13:20:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-11-21 13:20:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 13:20:19,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:20:19,589 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:20:19,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:19,793 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:20:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:20:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1089879194, now seen corresponding path program 1 times [2019-11-21 13:20:19,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:20:19,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2130742850] [2019-11-21 13:20:19,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:20:20,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 13:20:20,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:20:20,083 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-21 13:20:20,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:20:20,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:20:20,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:20:20,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:20:20,205 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:20:20,206 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 17 treesize of output 39 [2019-11-21 13:20:20,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:20:20,227 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 13:20:20,228 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-21 13:20:20,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-21 13:20:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:20:20,261 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:20:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:20:22,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2130742850] [2019-11-21 13:20:22,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:20:22,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-21 13:20:22,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581283436] [2019-11-21 13:20:22,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 13:20:22,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:20:22,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 13:20:22,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-21 13:20:22,653 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 13 states. [2019-11-21 13:20:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:20:41,343 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2019-11-21 13:20:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 13:20:41,343 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-21 13:20:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:20:41,347 INFO L225 Difference]: With dead ends: 219 [2019-11-21 13:20:41,347 INFO L226 Difference]: Without dead ends: 219 [2019-11-21 13:20:41,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-11-21 13:20:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-21 13:20:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 97. [2019-11-21 13:20:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-21 13:20:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2019-11-21 13:20:41,366 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 23 [2019-11-21 13:20:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:20:41,366 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2019-11-21 13:20:41,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 13:20:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2019-11-21 13:20:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 13:20:41,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:20:41,368 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:20:41,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:41,571 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:20:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:20:41,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1089879195, now seen corresponding path program 1 times [2019-11-21 13:20:41,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:20:41,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [893468558] [2019-11-21 13:20:41,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:20:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:20:41,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 13:20:41,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:20:41,868 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-21 13:20:41,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:20:41,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:20:41,883 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-21 13:20:41,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:20:41,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:20:41,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:20:41,894 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 13:20:44,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:20:44,066 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 14 treesize of output 16 [2019-11-21 13:20:44,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:20:44,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:20:44,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:20:44,111 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 11 treesize of output 15 [2019-11-21 13:20:44,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:20:44,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:20:44,127 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-21 13:20:44,127 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-11-21 13:20:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:20:44,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:20:44,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:20:44,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:20:44,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:20:44,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:20:44,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:20:44,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:20:44,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:20:44,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:20:52,159 WARN L192 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-11-21 13:20:52,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:21:01,473 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_187|], 2=[|v_#length_144|]} [2019-11-21 13:21:01,488 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 10 treesize of output 8 [2019-11-21 13:21:01,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:21:01,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:21:01,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 13:21:01,499 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:21:01,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:21:01,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:21:01,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:23, output treesize:5 [2019-11-21 13:21:02,218 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 13:21:02,229 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 10 treesize of output 8 [2019-11-21 13:21:02,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:21:02,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:21:02,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 13:21:02,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:21:02,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:21:02,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:21:02,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:33, output treesize:16 [2019-11-21 13:21:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:21:02,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [893468558] [2019-11-21 13:21:02,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:21:02,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-11-21 13:21:02,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173760664] [2019-11-21 13:21:02,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 13:21:02,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:21:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 13:21:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=325, Unknown=6, NotChecked=0, Total=380 [2019-11-21 13:21:02,463 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand 20 states. [2019-11-21 13:21:06,729 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~array~0.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse2)) (.cse1 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse2 (_ bv4 32)))) (or (not (bvsle (_ bv0 32) .cse0)) (bvsle .cse1 (select |c_#length| v_entry_point_~array~0.base_BEFORE_CALL_4)) (not (bvsle .cse0 .cse1)) (exists ((v_prenex_2 (_ BitVec 32)) (v_ldv_malloc_~size_28 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_2 v_ldv_malloc_~size_28) v_entry_point_~array~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (exists ((|v_ldv_malloc_#t~malloc12.base_23| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_23|) (_ bv0 1)))) is different from false [2019-11-21 13:21:23,077 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#t~malloc12.base_24| (_ BitVec 32)) (v_entry_point_~array~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (v_entry_point_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~array~0.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse2)) (.cse1 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse2 (_ bv4 32)))) (or (not (bvsle (_ bv0 32) .cse0)) (not (bvsle .cse0 .cse1)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_24|) (_ bv0 1))) (bvsle .cse1 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_24| ldv_malloc_~size) v_entry_point_~array~0.base_BEFORE_CALL_4)) (exists ((v_prenex_2 (_ BitVec 32)) (v_ldv_malloc_~size_28 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_2 v_ldv_malloc_~size_28) v_entry_point_~array~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~array~0.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse5 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse3 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse5)) (.cse4 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse5 (_ bv4 32)))) (or (not (bvsle (_ bv0 32) .cse3)) (bvsle .cse4 (select |c_#length| v_entry_point_~array~0.base_BEFORE_CALL_4)) (not (bvsle .cse3 .cse4)) (exists ((v_prenex_2 (_ BitVec 32)) (v_ldv_malloc_~size_28 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_2 v_ldv_malloc_~size_28) v_entry_point_~array~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))))))) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (exists ((|v_ldv_malloc_#t~malloc12.base_23| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_23|) (_ bv0 1)))) is different from false [2019-11-21 13:21:33,433 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2019-11-21 13:21:37,556 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv40 32) (select |c_#length| |c_entry_point_#t~ret38.base|)) (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~array~0.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse2)) (.cse1 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse2 (_ bv4 32)))) (or (not (bvsle (_ bv0 32) .cse0)) (bvsle .cse1 (select |c_#length| v_entry_point_~array~0.base_BEFORE_CALL_4)) (not (bvsle .cse0 .cse1)) (exists ((v_prenex_2 (_ BitVec 32)) (v_ldv_malloc_~size_28 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_2 v_ldv_malloc_~size_28) v_entry_point_~array~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (bvadd c_entry_point_~len~0 (_ bv4294967286 32)) (_ bv0 32)) (exists ((|v_ldv_malloc_#t~malloc12.base_23| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_23|) (_ bv0 1))) (= (bvadd (select |c_#valid| |c_entry_point_#t~ret38.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |c_entry_point_#t~ret38.offset|)) is different from false [2019-11-21 13:22:21,964 WARN L192 SmtUtils]: Spent 8.21 s on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-21 13:22:26,665 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-11-21 13:23:21,556 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-21 13:23:23,635 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_entry_point_~array~0.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse2)) (.cse1 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 .cse2 (_ bv4 32)))) (or (not (bvsle (_ bv0 32) .cse0)) (bvsle .cse1 (select |c_#length| v_entry_point_~array~0.base_BEFORE_CALL_4)) (not (bvsle .cse0 .cse1)) (exists ((v_prenex_2 (_ BitVec 32)) (v_ldv_malloc_~size_28 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_2 (bvmul v_entry_point_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_2 v_ldv_malloc_~size_28) v_entry_point_~array~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (bvadd c_entry_point_~len~0 (_ bv4294967286 32)) (_ bv0 32)) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ldv_malloc_#t~malloc12.base_23| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_23|) (_ bv0 1))) (= |c_old(#length)| |c_#length|)) is different from false [2019-11-21 13:24:02,396 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-21 13:24:02,797 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-21 13:24:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:24:15,159 INFO L93 Difference]: Finished difference Result 314 states and 406 transitions. [2019-11-21 13:24:15,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 13:24:15,161 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-11-21 13:24:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:24:15,163 INFO L225 Difference]: With dead ends: 314 [2019-11-21 13:24:15,164 INFO L226 Difference]: Without dead ends: 314 [2019-11-21 13:24:15,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 69.0s TimeCoverageRelationStatistics Valid=121, Invalid=686, Unknown=21, NotChecked=228, Total=1056 [2019-11-21 13:24:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-21 13:24:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 138. [2019-11-21 13:24:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-21 13:24:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2019-11-21 13:24:15,192 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 203 transitions. Word has length 23 [2019-11-21 13:24:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:24:15,192 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 203 transitions. [2019-11-21 13:24:15,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 13:24:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 203 transitions. [2019-11-21 13:24:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 13:24:15,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:24:15,194 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:24:15,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:15,397 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:24:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:24:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash 584320569, now seen corresponding path program 1 times [2019-11-21 13:24:15,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:24:15,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1642931207] [2019-11-21 13:24:15,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:24:15,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 13:24:15,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:24:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:24:15,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:24:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 13:24:15,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1642931207] [2019-11-21 13:24:15,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 13:24:15,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2019-11-21 13:24:15,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036060036] [2019-11-21 13:24:15,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:24:15,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:24:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:24:15,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:24:15,727 INFO L87 Difference]: Start difference. First operand 138 states and 203 transitions. Second operand 5 states. [2019-11-21 13:24:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:24:15,777 INFO L93 Difference]: Finished difference Result 114 states and 160 transitions. [2019-11-21 13:24:15,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:24:15,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-21 13:24:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:24:15,779 INFO L225 Difference]: With dead ends: 114 [2019-11-21 13:24:15,779 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 13:24:15,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-21 13:24:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 13:24:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-21 13:24:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-21 13:24:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2019-11-21 13:24:15,793 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 23 [2019-11-21 13:24:15,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:24:15,793 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2019-11-21 13:24:15,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:24:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2019-11-21 13:24:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-21 13:24:15,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:24:15,795 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:24:15,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:15,997 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:24:15,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:24:15,997 INFO L82 PathProgramCache]: Analyzing trace with hash -598155834, now seen corresponding path program 1 times [2019-11-21 13:24:15,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:24:15,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1299345332] [2019-11-21 13:24:15,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:24:16,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:24:16,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:24:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 13:24:16,245 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:24:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 13:24:16,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1299345332] [2019-11-21 13:24:16,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:24:16,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 13:24:16,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344759548] [2019-11-21 13:24:16,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:24:16,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:24:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:24:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:24:16,286 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand 5 states. [2019-11-21 13:24:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:24:16,339 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2019-11-21 13:24:16,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:24:16,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-21 13:24:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:24:16,341 INFO L225 Difference]: With dead ends: 146 [2019-11-21 13:24:16,342 INFO L226 Difference]: Without dead ends: 146 [2019-11-21 13:24:16,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 13:24:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-21 13:24:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2019-11-21 13:24:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-21 13:24:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2019-11-21 13:24:16,352 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 25 [2019-11-21 13:24:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:24:16,353 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2019-11-21 13:24:16,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:24:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2019-11-21 13:24:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-21 13:24:16,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:24:16,354 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:24:16,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:16,557 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:24:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:24:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1144654501, now seen corresponding path program 1 times [2019-11-21 13:24:16,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:24:16,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1363628731] [2019-11-21 13:24:16,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:24:16,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 13:24:16,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:24:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 13:24:16,829 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:24:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 13:24:16,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1363628731] [2019-11-21 13:24:16,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:24:16,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-21 13:24:16,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206281914] [2019-11-21 13:24:16,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 13:24:16,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:24:16,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 13:24:16,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 13:24:16,861 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand 6 states. [2019-11-21 13:24:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:24:16,957 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2019-11-21 13:24:16,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:24:16,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-21 13:24:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:24:16,960 INFO L225 Difference]: With dead ends: 112 [2019-11-21 13:24:16,960 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 13:24:16,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-21 13:24:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 13:24:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2019-11-21 13:24:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 13:24:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions. [2019-11-21 13:24:16,968 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 140 transitions. Word has length 25 [2019-11-21 13:24:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:24:16,969 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 140 transitions. [2019-11-21 13:24:16,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 13:24:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2019-11-21 13:24:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 13:24:16,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:24:16,970 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:24:17,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:17,174 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:24:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:24:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1124550030, now seen corresponding path program 1 times [2019-11-21 13:24:17,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:24:17,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [298666913] [2019-11-21 13:24:17,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:24:17,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 13:24:17,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:24:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 13:24:17,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:24:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 13:24:17,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [298666913] [2019-11-21 13:24:17,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:24:17,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-21 13:24:17,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634554932] [2019-11-21 13:24:17,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 13:24:17,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:24:17,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 13:24:17,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 13:24:17,661 INFO L87 Difference]: Start difference. First operand 106 states and 140 transitions. Second operand 9 states. [2019-11-21 13:24:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:24:17,868 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-11-21 13:24:17,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:24:17,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-21 13:24:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:24:17,870 INFO L225 Difference]: With dead ends: 105 [2019-11-21 13:24:17,870 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 13:24:17,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 13:24:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 13:24:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-21 13:24:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-21 13:24:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2019-11-21 13:24:17,876 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 26 [2019-11-21 13:24:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:24:17,877 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2019-11-21 13:24:17,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 13:24:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2019-11-21 13:24:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-21 13:24:17,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:24:17,879 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:24:18,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:18,083 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:24:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:24:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1014150018, now seen corresponding path program 1 times [2019-11-21 13:24:18,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:24:18,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [98362320] [2019-11-21 13:24:18,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:24:18,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 13:24:18,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:24:18,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:24:18,371 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 1 case distinctions, treesize of input 24 treesize of output 37 [2019-11-21 13:24:18,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:24:18,391 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-21 13:24:18,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:24:18,394 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-21 13:24:18,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-21 13:24:18,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:24:18,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:24:18,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:24:18,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:24:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 13:24:24,608 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:24:28,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:24:28,980 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 13:24:28,988 INFO L168 Benchmark]: Toolchain (without parser) took 254341.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.4 MB). Free memory was 956.3 MB in the beginning and 772.2 MB in the end (delta: 184.1 MB). Peak memory consumption was 440.5 MB. Max. memory is 11.5 GB. [2019-11-21 13:24:28,989 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:24:28,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -70.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-21 13:24:28,990 INFO L168 Benchmark]: Boogie Preprocessor took 132.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:24:28,990 INFO L168 Benchmark]: RCFGBuilder took 1652.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 909.7 MB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 11.5 GB. [2019-11-21 13:24:28,991 INFO L168 Benchmark]: TraceAbstraction took 251696.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 909.7 MB in the beginning and 772.2 MB in the end (delta: 137.5 MB). Peak memory consumption was 313.2 MB. Max. memory is 11.5 GB. [2019-11-21 13:24:28,994 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 855.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -70.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1652.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 909.7 MB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 251696.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 909.7 MB in the beginning and 772.2 MB in the end (delta: 137.5 MB). Peak memory consumption was 313.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...