./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.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_test6_2.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 72845188532fe6d4486465eb4d1c3f34d4b417b7 --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 12:39:18,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:39:18,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:39:18,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:39:18,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:39:18,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:39:18,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:39:18,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:39:18,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:39:18,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:39:18,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:39:18,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:39:18,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:39:18,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:39:18,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:39:18,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:39:18,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:39:18,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:39:18,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:39:18,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:39:18,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:39:18,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:39:18,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:39:18,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:39:18,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:39:18,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:39:18,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:39:18,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:39:18,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:39:18,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:39:18,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:39:18,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:39:18,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:39:18,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:39:18,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:39:18,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:39:18,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:39:18,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:39:18,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:39:18,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:39:18,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:39:18,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 12:39:18,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:39:18,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:39:18,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:39:18,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:39:18,144 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:39:18,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:39:18,146 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:39:18,146 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:39:18,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:39:18,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:39:18,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:39:18,148 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:39:18,148 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:39:18,148 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:39:18,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:39:18,149 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:39:18,149 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:39:18,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:39:18,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:39:18,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:39:18,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:39:18,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:39:18,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:39:18,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:39:18,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:39:18,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:39:18,152 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:39:18,152 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:39:18,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:39:18,153 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 -> 72845188532fe6d4486465eb4d1c3f34d4b417b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 12:39:18,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:39:18,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:39:18,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:39:18,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:39:18,490 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:39:18,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-11-21 12:39:18,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909bad420/cc5b986855664d6daf73923e0971301b/FLAGc1cd28864 [2019-11-21 12:39:19,133 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:39:19,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-11-21 12:39:19,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909bad420/cc5b986855664d6daf73923e0971301b/FLAGc1cd28864 [2019-11-21 12:39:19,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909bad420/cc5b986855664d6daf73923e0971301b [2019-11-21 12:39:19,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:39:19,471 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:39:19,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:39:19,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:39:19,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:39:19,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:39:19" (1/1) ... [2019-11-21 12:39:19,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2288bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:19, skipping insertion in model container [2019-11-21 12:39:19,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:39:19" (1/1) ... [2019-11-21 12:39:19,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:39:19,537 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:39:19,981 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 12:39:19,982 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 12:39:19,982 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:39:20,009 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 12:39:20,010 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 12:39:20,010 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:39:20,016 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 12:39:20,016 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 12:39:20,016 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:39:20,020 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 12:39:20,021 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 12:39:20,021 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:39:20,061 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 12:39:20,062 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 12:39:20,062 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:39:20,080 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 12:39:20,081 INFO L969 CHandler]: at location: C: (int *)ldv_malloc(sizeof(int)) [766] [2019-11-21 12:39:20,082 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:39:20,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:39:20,130 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:39:20,146 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:39:20,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:39:20,233 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:39:20,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:39:20,382 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:39:20,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20 WrapperNode [2019-11-21 12:39:20,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:39:20,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:39:20,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:39:20,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:39:20,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (1/1) ... [2019-11-21 12:39:20,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (1/1) ... [2019-11-21 12:39:20,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (1/1) ... [2019-11-21 12:39:20,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (1/1) ... [2019-11-21 12:39:20,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (1/1) ... [2019-11-21 12:39:20,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (1/1) ... [2019-11-21 12:39:20,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (1/1) ... [2019-11-21 12:39:20,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:39:20,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:39:20,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:39:20,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:39:20,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (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 12:39:20,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:39:20,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:39:20,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:39:20,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:39:20,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:39:20,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 12:39:20,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 12:39:20,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 12:39:20,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 12:39:20,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 12:39:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 12:39:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 12:39:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:39:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 12:39:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 12:39:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 12:39:20,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 12:39:20,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 12:39:20,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 12:39:20,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 12:39:20,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 12:39:20,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 12:39:20,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 12:39:20,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 12:39:20,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 12:39:20,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 12:39:20,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 12:39:20,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 12:39:20,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 12:39:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 12:39:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 12:39:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 12:39:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 12:39:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 12:39:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 12:39:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 12:39:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 12:39:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 12:39:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 12:39:20,571 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 12:39:20,571 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 12:39:20,571 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2019-11-21 12:39:20,571 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2019-11-21 12:39:20,571 INFO L138 BoogieDeclarations]: Found implementation of procedure probe3_6 [2019-11-21 12:39:20,571 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2019-11-21 12:39:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 12:39:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:39:20,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 12:39:20,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 12:39:20,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 12:39:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:39:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:39:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:39:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:39:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:39:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:39:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:39:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:39:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:39:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:39:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:39:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:39:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:39:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:39:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:39:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:39:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:39:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:39:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 12:39:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 12:39:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 12:39:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:39:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:39:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:39:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:39:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:39:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:39:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:39:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:39:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:39:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:39:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:39:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:39:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:39:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:39:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:39:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:39:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:39:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:39:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:39:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:39:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:39:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:39:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:39:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:39:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:39:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:39:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:39:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:39:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:39:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:39:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:39:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:39:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:39:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:39:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:39:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:39:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:39:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:39:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:39:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:39:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:39:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:39:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:39:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:39:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:39:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:39:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:39:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:39:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:39:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:39:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:39:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:39:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:39:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:39:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:39:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:39:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:39:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:39:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:39:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:39:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:39:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:39:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:39:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:39:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:39:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:39:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:39:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:39:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:39:20,604 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:39:20,604 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:39:20,604 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:39:20,604 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:39:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:39:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:39:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:39:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:39:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:39:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:39:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:39:20,606 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:39:20,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:39:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:39:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:39:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:39:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:39:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 12:39:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:39:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 12:39:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 12:39:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 12:39:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 12:39:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 12:39:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 12:39:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:39:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 12:39:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 12:39:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:39:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:39:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 12:39:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 12:39:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 12:39:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:39:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 12:39:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 12:39:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 12:39:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 12:39:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 12:39:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 12:39:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:39:20,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 12:39:20,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 12:39:20,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 12:39:20,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 12:39:20,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 12:39:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:39:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:39:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 12:39:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 12:39:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:39:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 12:39:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 12:39:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 12:39:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 12:39:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 12:39:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 12:39:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 12:39:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 12:39:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 12:39:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure probe3_6 [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2019-11-21 12:39:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 12:39:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:39:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:39:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 12:39:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 12:39:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:39:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 12:39:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 12:39:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 12:39:20,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 12:39:21,300 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:39:21,698 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:39:22,153 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:39:22,153 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-21 12:39:22,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:39:22 BoogieIcfgContainer [2019-11-21 12:39:22,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:39:22,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:39:22,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:39:22,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:39:22,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:39:19" (1/3) ... [2019-11-21 12:39:22,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725505d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:39:22, skipping insertion in model container [2019-11-21 12:39:22,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:39:20" (2/3) ... [2019-11-21 12:39:22,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725505d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:39:22, skipping insertion in model container [2019-11-21 12:39:22,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:39:22" (3/3) ... [2019-11-21 12:39:22,163 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2.i [2019-11-21 12:39:22,174 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:39:22,186 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 86 error locations. [2019-11-21 12:39:22,203 INFO L249 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2019-11-21 12:39:22,230 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:39:22,231 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:39:22,231 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:39:22,231 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:39:22,231 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:39:22,231 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:39:22,231 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:39:22,231 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:39:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-11-21 12:39:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:39:22,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:22,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:22,278 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1197645573, now seen corresponding path program 1 times [2019-11-21 12:39:22,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:22,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [776423834] [2019-11-21 12:39:22,304 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 12:39:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:22,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:39:22,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:22,754 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 12:39:22,754 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:22,872 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 12:39:22,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [776423834] [2019-11-21 12:39:22,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:22,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:39:22,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737721742] [2019-11-21 12:39:22,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:39:22,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:22,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:39:22,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:39:22,900 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 5 states. [2019-11-21 12:39:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:23,011 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2019-11-21 12:39:23,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:39:23,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-21 12:39:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:23,026 INFO L225 Difference]: With dead ends: 94 [2019-11-21 12:39:23,026 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 12:39:23,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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 12:39:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 12:39:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-11-21 12:39:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-21 12:39:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-21 12:39:23,108 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 20 [2019-11-21 12:39:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:23,109 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-21 12:39:23,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:39:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-21 12:39:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:39:23,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:23,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:23,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:23,316 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:23,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:23,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1001132068, now seen corresponding path program 1 times [2019-11-21 12:39:23,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:23,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1499364788] [2019-11-21 12:39:23,318 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 12:39:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:23,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 12:39:23,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:23,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:23,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 12:39:23,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:23,725 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-21 12:39:23,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:39:23,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-21 12:39:23,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:39:23,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:23,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:23,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:39:23,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-21 12:39:23,785 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 12:39:23,785 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:39:23,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-21 12:39:23,967 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:39:23,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:23,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:39:23,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2019-11-21 12:39:24,103 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 12:39:24,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1499364788] [2019-11-21 12:39:24,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:24,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 12:39:24,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864913131] [2019-11-21 12:39:24,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:39:24,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:39:24,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:39:24,114 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2019-11-21 12:39:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:24,528 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2019-11-21 12:39:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:39:24,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-21 12:39:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:24,531 INFO L225 Difference]: With dead ends: 120 [2019-11-21 12:39:24,531 INFO L226 Difference]: Without dead ends: 120 [2019-11-21 12:39:24,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-21 12:39:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-21 12:39:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2019-11-21 12:39:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 12:39:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2019-11-21 12:39:24,561 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 20 [2019-11-21 12:39:24,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:24,562 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2019-11-21 12:39:24,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:39:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2019-11-21 12:39:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:39:24,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:24,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:24,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:24,765 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1001132067, now seen corresponding path program 1 times [2019-11-21 12:39:24,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:24,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1245843619] [2019-11-21 12:39:24,767 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 12:39:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:25,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 12:39:25,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:25,071 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:39:25,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:39:25,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:25,104 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-21 12:39:25,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:25,107 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 12:39:25,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-11-21 12:39:25,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:25,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:39:25,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:25,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:25,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:39:25,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 12:39:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:39:25,144 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:25,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:25,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-21 12:39:25,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:25,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:25,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:39:25,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-21 12:39:25,226 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 12:39:25,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1245843619] [2019-11-21 12:39:25,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:25,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 12:39:25,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695135300] [2019-11-21 12:39:25,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:39:25,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:39:25,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:39:25,229 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 5 states. [2019-11-21 12:39:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:25,429 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2019-11-21 12:39:25,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:39:25,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-21 12:39:25,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:25,436 INFO L225 Difference]: With dead ends: 129 [2019-11-21 12:39:25,438 INFO L226 Difference]: Without dead ends: 125 [2019-11-21 12:39:25,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:39:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-21 12:39:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2019-11-21 12:39:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 12:39:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2019-11-21 12:39:25,466 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 20 [2019-11-21 12:39:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:25,467 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2019-11-21 12:39:25,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:39:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2019-11-21 12:39:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:39:25,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:25,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:25,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:25,673 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:25,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1183679111, now seen corresponding path program 1 times [2019-11-21 12:39:25,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:25,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [255533566] [2019-11-21 12:39:25,674 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 12:39:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:25,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:39:25,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:25,929 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 12:39:25,931 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:25,972 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 12:39:25,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [255533566] [2019-11-21 12:39:25,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:25,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:39:25,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772058454] [2019-11-21 12:39:25,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:39:25,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:39:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:39:25,974 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 5 states. [2019-11-21 12:39:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:26,014 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2019-11-21 12:39:26,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:39:26,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 12:39:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:26,016 INFO L225 Difference]: With dead ends: 104 [2019-11-21 12:39:26,017 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 12:39:26,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 12:39:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 12:39:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 12:39:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 12:39:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2019-11-21 12:39:26,041 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 22 [2019-11-21 12:39:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:26,041 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2019-11-21 12:39:26,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:39:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2019-11-21 12:39:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:39:26,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:26,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:26,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:26,245 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:26,245 INFO L82 PathProgramCache]: Analyzing trace with hash 15252322, now seen corresponding path program 1 times [2019-11-21 12:39:26,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:26,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1872271883] [2019-11-21 12:39:26,246 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 12:39:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:26,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:39:26,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:26,549 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 12:39:26,550 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:26,619 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 12:39:26,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1872271883] [2019-11-21 12:39:26,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:26,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-21 12:39:26,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418877946] [2019-11-21 12:39:26,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:39:26,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:39:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:39:26,622 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand 10 states. [2019-11-21 12:39:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:26,687 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2019-11-21 12:39:26,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:39:26,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 12:39:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:26,690 INFO L225 Difference]: With dead ends: 118 [2019-11-21 12:39:26,690 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 12:39:26,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:39:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 12:39:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-11-21 12:39:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 12:39:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-11-21 12:39:26,701 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 22 [2019-11-21 12:39:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:26,701 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-11-21 12:39:26,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:39:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-11-21 12:39:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 12:39:26,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:26,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:26,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:26,907 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1960653489, now seen corresponding path program 1 times [2019-11-21 12:39:26,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:26,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1994768011] [2019-11-21 12:39:26,909 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 12:39:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:27,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:39:27,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:27,253 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 12:39:27,254 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:27,332 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 12:39:27,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1994768011] [2019-11-21 12:39:27,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:27,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-21 12:39:27,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751368371] [2019-11-21 12:39:27,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 12:39:27,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 12:39:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 12:39:27,334 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 9 states. [2019-11-21 12:39:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:27,540 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-11-21 12:39:27,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:39:27,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-21 12:39:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:27,541 INFO L225 Difference]: With dead ends: 106 [2019-11-21 12:39:27,541 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 12:39:27,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 12:39:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 12:39:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-21 12:39:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 12:39:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2019-11-21 12:39:27,549 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 23 [2019-11-21 12:39:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:27,550 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2019-11-21 12:39:27,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 12:39:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2019-11-21 12:39:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 12:39:27,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:27,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:27,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:27,756 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:27,757 INFO L82 PathProgramCache]: Analyzing trace with hash 650716283, now seen corresponding path program 1 times [2019-11-21 12:39:27,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:27,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1724876830] [2019-11-21 12:39:27,758 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 12:39:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:28,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:39:28,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:28,034 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 12:39:28,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:28,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:28,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:39:28,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:39:28,088 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 12:39:28,089 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:28,136 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 12:39:28,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1724876830] [2019-11-21 12:39:28,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:28,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 12:39:28,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174760752] [2019-11-21 12:39:28,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:39:28,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:39:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:39:28,140 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 6 states. [2019-11-21 12:39:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:28,348 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-11-21 12:39:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:39:28,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-21 12:39:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:28,351 INFO L225 Difference]: With dead ends: 108 [2019-11-21 12:39:28,352 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 12:39:28,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:39:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 12:39:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-11-21 12:39:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 12:39:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-11-21 12:39:28,359 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 24 [2019-11-21 12:39:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:28,360 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-11-21 12:39:28,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:39:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-11-21 12:39:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 12:39:28,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:28,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:28,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:28,566 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:28,567 INFO L82 PathProgramCache]: Analyzing trace with hash 145157658, now seen corresponding path program 1 times [2019-11-21 12:39:28,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:28,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1432057758] [2019-11-21 12:39:28,568 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 12:39:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:28,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:39:28,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:39:28,877 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:28,899 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 12:39:28,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432057758] [2019-11-21 12:39:28,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:28,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-21 12:39:28,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657410498] [2019-11-21 12:39:28,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:39:28,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:28,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:39:28,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:39:28,901 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2019-11-21 12:39:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:28,965 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-11-21 12:39:28,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:39:28,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-21 12:39:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:28,966 INFO L225 Difference]: With dead ends: 85 [2019-11-21 12:39:28,966 INFO L226 Difference]: Without dead ends: 83 [2019-11-21 12:39:28,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-21 12:39:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-21 12:39:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-21 12:39:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-21 12:39:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-11-21 12:39:28,972 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 24 [2019-11-21 12:39:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:28,972 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-11-21 12:39:28,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:39:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-11-21 12:39:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 12:39:28,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:28,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:29,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:29,178 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1292376138, now seen corresponding path program 1 times [2019-11-21 12:39:29,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:29,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1168100144] [2019-11-21 12:39:29,180 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 12:39:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:29,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 12:39:29,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:29,512 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:39:29,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:39:29,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:29,540 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-21 12:39:29,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:29,543 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 12:39:29,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-11-21 12:39:29,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:29,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:29,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-21 12:39:29,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:29,653 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 12:39:29,654 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 12:39:29,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 12:39:29,837 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 12:39:29,838 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:34,286 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 12:39:34,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1168100144] [2019-11-21 12:39:34,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:34,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-21 12:39:34,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074989226] [2019-11-21 12:39:34,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:39:34,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:39:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2019-11-21 12:39:34,290 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 14 states. [2019-11-21 12:39:34,875 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-21 12:39:35,426 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-21 12:39:35,842 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-21 12:39:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:39:40,453 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-11-21 12:39:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:39:40,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-11-21 12:39:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:39:40,455 INFO L225 Difference]: With dead ends: 81 [2019-11-21 12:39:40,455 INFO L226 Difference]: Without dead ends: 81 [2019-11-21 12:39:40,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=98, Invalid=281, Unknown=1, NotChecked=0, Total=380 [2019-11-21 12:39:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-21 12:39:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-11-21 12:39:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-21 12:39:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-11-21 12:39:40,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 28 [2019-11-21 12:39:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:39:40,461 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-11-21 12:39:40,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:39:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-11-21 12:39:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 12:39:40,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:39:40,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:39:40,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:39:40,664 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:39:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:39:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1292376139, now seen corresponding path program 1 times [2019-11-21 12:39:40,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:39:40,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [756187671] [2019-11-21 12:39:40,666 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 12:39:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:39:40,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 12:39:40,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:39:41,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:41,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 12:39:41,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:41,049 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 12:39:41,106 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:39:41,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:39:41,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:41,160 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-11-21 12:39:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:41,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:39:41,164 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-11-21 12:39:41,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:41,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:41,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:41,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:41,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:41,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:41,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:41,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:41,399 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-11-21 12:39:43,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:43,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:43,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-11-21 12:39:43,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:43,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:43,588 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 34 treesize of output 38 [2019-11-21 12:39:43,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:43,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:43,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2019-11-21 12:39:43,619 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:43,667 INFO L567 ElimStorePlain]: treesize reduction 57, result has 26.9 percent of original size [2019-11-21 12:39:43,672 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 12:39:43,673 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:39:43,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:39:43,687 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 12:39:43,687 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:11 [2019-11-21 12:39:43,796 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 12:39:43,797 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:39:43,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:46,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:46,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:46,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:46,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:46,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:39:46,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:46,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:46,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:48,666 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 12:39:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:39:53,664 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 12:39:53,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756187671] [2019-11-21 12:39:53,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:39:53,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-21 12:39:53,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057459140] [2019-11-21 12:39:53,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 12:39:53,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:39:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 12:39:53,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=167, Unknown=5, NotChecked=0, Total=210 [2019-11-21 12:39:53,667 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 15 states. [2019-11-21 12:40:04,407 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 12:40:10,517 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_probe3_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe3_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_probe3_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (bvsle .cse0 (select |c_#length| v_probe3_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_3 (_ BitVec 32)) (v_ldv_malloc_~size_47 (_ BitVec 32))) (and (not (bvsle (bvadd v_probe3_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_3 v_ldv_malloc_~size_47) v_probe3_6_~a.base_BEFORE_CALL_12))) (= (select |c_old(#valid)| v_prenex_3) (_ bv0 1)))) (not (bvsle (_ bv0 32) v_probe3_6_~a.offset_BEFORE_CALL_6)) (not (bvsle v_probe3_6_~a.offset_BEFORE_CALL_6 .cse0))))) (= |c_~#a6~0.offset| (_ bv0 32)) (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 ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= |c_~#a6~0.base| |~#ldv_global_msg_list~0.base|) (= (bvadd (select |c_#length| |~#ldv_global_msg_list~0.base|) (_ bv4294967288 32)) (_ bv0 32))) (= (bvadd (select |c_#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1)) (or (= (_ bv0 1) (select |c_#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|) (= |c_~#a6~0.base| (_ bv0 32))))) (= (_ bv1 1) (select |c_#valid| |c_~#a6~0.base|)) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4))) (= (_ bv4 32) (select |c_#length| |c_~#a6~0.base|))) is different from false [2019-11-21 12:40:24,823 WARN L192 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-11-21 12:40:29,354 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 12:40:31,377 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_probe3_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe3_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_probe3_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (bvsle .cse0 (select |c_#length| v_probe3_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_3 (_ BitVec 32)) (v_ldv_malloc_~size_47 (_ BitVec 32))) (and (not (bvsle (bvadd v_probe3_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_3 v_ldv_malloc_~size_47) v_probe3_6_~a.base_BEFORE_CALL_12))) (= (select |c_old(#valid)| v_prenex_3) (_ bv0 1)))) (not (bvsle (_ bv0 32) v_probe3_6_~a.offset_BEFORE_CALL_6)) (not (bvsle v_probe3_6_~a.offset_BEFORE_CALL_6 .cse0))))) (= c_probe3_6_~a.offset (_ bv0 32)) (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 (select |c_#length| c_probe3_6_~a.base) (_ bv4294967292 32)) (_ bv0 32)) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) is different from false [2019-11-21 12:41:07,967 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_probe3_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe3_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_probe3_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (bvsle .cse0 (select |c_#length| v_probe3_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_3 (_ BitVec 32)) (v_ldv_malloc_~size_47 (_ BitVec 32))) (and (not (bvsle (bvadd v_probe3_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_3 v_ldv_malloc_~size_47) v_probe3_6_~a.base_BEFORE_CALL_12))) (= (select |c_old(#valid)| v_prenex_3) (_ bv0 1)))) (not (bvsle (_ bv0 32) v_probe3_6_~a.offset_BEFORE_CALL_6)) (not (bvsle v_probe3_6_~a.offset_BEFORE_CALL_6 .cse0))))) (exists ((v_probe3_6_~a.base_BEFORE_CALL_8 (_ BitVec 32))) (= (bvadd (select |c_#length| v_probe3_6_~a.base_BEFORE_CALL_8) (_ bv4294967292 32)) (_ bv0 32))) (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|))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#length)| |c_#length|) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) is different from false [2019-11-21 12:41:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:41:26,315 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-21 12:41:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-21 12:41:26,316 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-11-21 12:41:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:41:26,317 INFO L225 Difference]: With dead ends: 79 [2019-11-21 12:41:26,317 INFO L226 Difference]: Without dead ends: 62 [2019-11-21 12:41:26,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=126, Invalid=423, Unknown=15, NotChecked=138, Total=702 [2019-11-21 12:41:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-21 12:41:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-21 12:41:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-21 12:41:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-21 12:41:26,321 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 28 [2019-11-21 12:41:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:41:26,321 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-21 12:41:26,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 12:41:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-21 12:41:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 12:41:26,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:41:26,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:41:26,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:41:26,527 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:41:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:41:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -18189035, now seen corresponding path program 1 times [2019-11-21 12:41:26,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:41:26,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1704373898] [2019-11-21 12:41:26,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:41:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:41:26,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-21 12:41:26,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:41:26,865 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:41:26,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:41:26,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:26,910 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.8 percent of original size [2019-11-21 12:41:26,931 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:26,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 12:41:26,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:26,985 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-11-21 12:41:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:26,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:41:26,988 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-11-21 12:41:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:26,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:27,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:27,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:27,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:27,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:27,086 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 37 treesize of output 41 [2019-11-21 12:41:27,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:27,092 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 30 treesize of output 28 [2019-11-21 12:41:27,092 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:27,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-11-21 12:41:27,111 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:27,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:27,135 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 39 treesize of output 43 [2019-11-21 12:41:27,135 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:27,142 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 32 treesize of output 30 [2019-11-21 12:41:27,142 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:27,197 INFO L567 ElimStorePlain]: treesize reduction 118, result has 11.3 percent of original size [2019-11-21 12:41:27,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:41:27,202 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:27,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:27,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:41:27,213 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:169, output treesize:10 [2019-11-21 12:41:29,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:41:29,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:29,295 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 12:41:29,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:29,302 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 12:41:29,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:3 [2019-11-21 12:41:29,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:29,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:29,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,353 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 39 treesize of output 41 [2019-11-21 12:41:29,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:29,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 59 [2019-11-21 12:41:29,404 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,423 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 37 treesize of output 39 [2019-11-21 12:41:29,424 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:29,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 61 [2019-11-21 12:41:29,463 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,498 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:29,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 56 [2019-11-21 12:41:29,500 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:41:29,525 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 37 treesize of output 39 [2019-11-21 12:41:29,526 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,740 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-11-21 12:41:29,741 INFO L567 ElimStorePlain]: treesize reduction 139, result has 39.3 percent of original size [2019-11-21 12:41:29,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:29,764 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 33 treesize of output 37 [2019-11-21 12:41:29,764 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,786 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:29,786 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 27 treesize of output 31 [2019-11-21 12:41:29,787 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:41:29,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2019-11-21 12:41:29,825 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-21 12:41:29,880 INFO L567 ElimStorePlain]: treesize reduction 51, result has 26.1 percent of original size [2019-11-21 12:41:29,881 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 12:41:29,881 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:251, output treesize:9 [2019-11-21 12:41:29,909 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 12:41:29,910 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:41:30,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:41:32,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:32,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:32,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:41:32,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:41:32,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:41:32,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:41:32,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:41:32,366 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-11-21 12:41:32,385 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2019-11-21 12:41:32,400 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_5|], 15=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-11-21 12:41:32,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:41:32,605 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 12:41:32,617 INFO L168 Benchmark]: Toolchain (without parser) took 133146.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. [2019-11-21 12:41:32,620 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:41:32,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 911.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-21 12:41:32,624 INFO L168 Benchmark]: Boogie Preprocessor took 119.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-21 12:41:32,624 INFO L168 Benchmark]: RCFGBuilder took 1651.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 957.5 MB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2019-11-21 12:41:32,625 INFO L168 Benchmark]: TraceAbstraction took 130458.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2019-11-21 12:41:32,628 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 911.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1651.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 957.5 MB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 130458.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 41.9 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...