./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-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_test10-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 d4308bd7904aec4bec637498669b187d310fac2d --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:31:21,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:31:21,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:31:21,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:31:21,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:31:21,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:31:21,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:31:21,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:31:21,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:31:21,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:31:21,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:31:21,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:31:21,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:31:21,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:31:21,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:31:21,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:31:21,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:31:21,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:31:21,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:31:21,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:31:21,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:31:21,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:31:21,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:31:21,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:31:21,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:31:21,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:31:21,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:31:21,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:31:21,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:31:21,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:31:21,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:31:21,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:31:21,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:31:21,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:31:21,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:31:21,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:31:21,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:31:21,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:31:21,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:31:21,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:31:21,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:31:21,687 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:31:21,721 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:31:21,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:31:21,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:31:21,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:31:21,726 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:31:21,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:31:21,728 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:31:21,729 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:31:21,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:31:21,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:31:21,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:31:21,730 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:31:21,730 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:31:21,731 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:31:21,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:31:21,732 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:31:21,732 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:21,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:31:21,733 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:31:21,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:31:21,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:31:21,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:31:21,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:31:21,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:31:21,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:31:21,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:31:21,735 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:31:21,735 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:31:21,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:31:21,736 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 -> d4308bd7904aec4bec637498669b187d310fac2d 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:31:22,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:31:22,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:31:22,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:31:22,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:31:22,075 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:31:22,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2019-11-21 12:31:22,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69f25e52/f2230db67a2045369688c2d17750edcc/FLAG60f8aef38 [2019-11-21 12:31:22,674 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:31:22,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2019-11-21 12:31:22,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69f25e52/f2230db67a2045369688c2d17750edcc/FLAG60f8aef38 [2019-11-21 12:31:22,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69f25e52/f2230db67a2045369688c2d17750edcc [2019-11-21 12:31:22,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:31:22,974 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:31:22,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:31:22,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:31:22,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:31:22,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:31:22" (1/1) ... [2019-11-21 12:31:22,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ddb1261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:22, skipping insertion in model container [2019-11-21 12:31:22,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:31:22" (1/1) ... [2019-11-21 12:31:22,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:31:23,068 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:31:23,459 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:31:23,459 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 12:31:23,459 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,488 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:31:23,488 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 12:31:23,489 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,493 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:31:23,494 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 12:31:23,494 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,498 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:31:23,498 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 12:31:23,498 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,536 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:31:23,537 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 12:31:23,537 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,566 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:31:23,566 INFO L969 CHandler]: at location: C: (int *)ldv_malloc(sizeof(int)) [768] [2019-11-21 12:31:23,567 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,572 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:31:23,573 INFO L969 CHandler]: at location: C: (struct A10 *)ldv_malloc(sizeof(struct A10)) [774] [2019-11-21 12:31:23,573 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,575 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:31:23,576 INFO L969 CHandler]: at location: C: (struct B10 *)ldv_malloc(sizeof(struct B10)) [776] [2019-11-21 12:31:23,576 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,579 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:31:23,581 INFO L969 CHandler]: at location: C: (struct C10 *)ldv_malloc(sizeof(struct C10)) [778] [2019-11-21 12:31:23,581 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:31:23,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:31:23,624 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:31:23,641 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:31:23,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:31:23,749 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:31:23,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:31:23,898 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:31:23,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23 WrapperNode [2019-11-21 12:31:23,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:31:23,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:31:23,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:31:23,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:31:23,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (1/1) ... [2019-11-21 12:31:23,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (1/1) ... [2019-11-21 12:31:23,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (1/1) ... [2019-11-21 12:31:23,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (1/1) ... [2019-11-21 12:31:23,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (1/1) ... [2019-11-21 12:31:24,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (1/1) ... [2019-11-21 12:31:24,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (1/1) ... [2019-11-21 12:31:24,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:31:24,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:31:24,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:31:24,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:31:24,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (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:31:24,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:31:24,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:31:24,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:31:24,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:31:24,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:31:24,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 12:31:24,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 12:31:24,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 12:31:24,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 12:31:24,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 12:31:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 12:31:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 12:31:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:31:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 12:31:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 12:31:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 12:31:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 12:31:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 12:31:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 12:31:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 12:31:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 12:31:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 12:31:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 12:31:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 12:31:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 12:31:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 12:31:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 12:31:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 12:31:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 12:31:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 12:31:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 12:31:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 12:31:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 12:31:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 12:31:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 12:31:24,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 12:31:24,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 12:31:24,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 12:31:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 12:31:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 12:31:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 12:31:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_10 [2019-11-21 12:31:24,102 INFO L138 BoogieDeclarations]: Found implementation of procedure free_10 [2019-11-21 12:31:24,103 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 12:31:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:31:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 12:31:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 12:31:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 12:31:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:31:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:31:24,105 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:31:24,105 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:31:24,105 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:31:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:31:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:31:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:31:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:31:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:31:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:31:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 12:31:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 12:31:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:31:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:31:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:31:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:31:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:31:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:31:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:31:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:31:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:31:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:31:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:31:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:31:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:31:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:31:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:31:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:31:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:31:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:31:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:31:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:31:24,111 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:31:24,111 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:31:24,111 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:31:24,112 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:31:24,112 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:31:24,112 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:31:24,112 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:31:24,112 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:31:24,112 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:31:24,113 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:31:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:31:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:31:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:31:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:31:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:31:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:31:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:31:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:31:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:31:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:31:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:31:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:31:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:31:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:31:24,127 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:31:24,127 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:31:24,127 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:31:24,128 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:31:24,128 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:31:24,128 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:31:24,128 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:31:24,128 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:31:24,128 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:31:24,128 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:31:24,129 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:31:24,129 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:31:24,129 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:31:24,129 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:31:24,129 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:31:24,129 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:31:24,130 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:31:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:31:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:31:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:31:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:31:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:31:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:31:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:31:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:31:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:31:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:31:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:31:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:31:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:31:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:31:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:31:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:31:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:31:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:31:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:31:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:31:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:31:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:31:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:31:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:31:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:31:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 12:31:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:31:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 12:31:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 12:31:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 12:31:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 12:31:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 12:31:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 12:31:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:31:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 12:31:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 12:31:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:31:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:31:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 12:31:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 12:31:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 12:31:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:31:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 12:31:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 12:31:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 12:31:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 12:31:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 12:31:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 12:31:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:31:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 12:31:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 12:31:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 12:31:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 12:31:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 12:31:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:31:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:31:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 12:31:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 12:31:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:31:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 12:31:24,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 12:31:24,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 12:31:24,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 12:31:24,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 12:31:24,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 12:31:24,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 12:31:24,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 12:31:24,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 12:31:24,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 12:31:24,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 12:31:24,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 12:31:24,144 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 12:31:24,144 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 12:31:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_10 [2019-11-21 12:31:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure free_10 [2019-11-21 12:31:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 12:31:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:31:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:31:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 12:31:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 12:31:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:31:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 12:31:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 12:31:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 12:31:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 12:31:24,767 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:31:25,207 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:31:25,778 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:31:25,779 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-21 12:31:25,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:31:25 BoogieIcfgContainer [2019-11-21 12:31:25,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:31:25,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:31:25,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:31:25,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:31:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:31:22" (1/3) ... [2019-11-21 12:31:25,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc618ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:31:25, skipping insertion in model container [2019-11-21 12:31:25,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:31:23" (2/3) ... [2019-11-21 12:31:25,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc618ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:31:25, skipping insertion in model container [2019-11-21 12:31:25,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:31:25" (3/3) ... [2019-11-21 12:31:25,790 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test10-2.i [2019-11-21 12:31:25,803 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:31:25,813 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 113 error locations. [2019-11-21 12:31:25,827 INFO L249 AbstractCegarLoop]: Starting to check reachability of 113 error locations. [2019-11-21 12:31:25,851 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:31:25,852 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:31:25,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:31:25,852 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:31:25,853 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:31:25,853 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:31:25,853 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:31:25,853 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:31:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states. [2019-11-21 12:31:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:31:25,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:31:25,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:31:25,892 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:31:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:31:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1033291871, now seen corresponding path program 1 times [2019-11-21 12:31:25,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:31:25,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [129503630] [2019-11-21 12:31:25,914 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:31:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:31:26,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:31:26,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:31:26,293 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:31:26,294 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:31:26,393 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:31:26,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [129503630] [2019-11-21 12:31:26,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:31:26,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:31:26,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765006487] [2019-11-21 12:31:26,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:31:26,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:31:26,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:31:26,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:31:26,425 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 5 states. [2019-11-21 12:31:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:31:26,714 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2019-11-21 12:31:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:31:26,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-21 12:31:26,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:31:26,730 INFO L225 Difference]: With dead ends: 163 [2019-11-21 12:31:26,730 INFO L226 Difference]: Without dead ends: 160 [2019-11-21 12:31:26,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:31:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-21 12:31:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 106. [2019-11-21 12:31:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 12:31:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-11-21 12:31:26,793 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 16 [2019-11-21 12:31:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:31:26,794 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-11-21 12:31:26,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:31:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-11-21 12:31:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:31:26,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:31:26,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:31:26,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:31:27,000 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:31:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:31:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1518865090, now seen corresponding path program 1 times [2019-11-21 12:31:27,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:31:27,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1111879311] [2019-11-21 12:31:27,002 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:31:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:31:27,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:31:27,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:31:27,260 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:31:27,261 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:31:27,329 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:31:27,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1111879311] [2019-11-21 12:31:27,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:31:27,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:31:27,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333465916] [2019-11-21 12:31:27,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:31:27,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:31:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:31:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:31:27,334 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 3 states. [2019-11-21 12:31:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:31:27,643 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2019-11-21 12:31:27,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:31:27,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-21 12:31:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:31:27,648 INFO L225 Difference]: With dead ends: 156 [2019-11-21 12:31:27,649 INFO L226 Difference]: Without dead ends: 153 [2019-11-21 12:31:27,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:31:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-21 12:31:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 102. [2019-11-21 12:31:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 12:31:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2019-11-21 12:31:27,662 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2019-11-21 12:31:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:31:27,662 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2019-11-21 12:31:27,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:31:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2019-11-21 12:31:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:31:27,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:31:27,663 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:31:27,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:31:27,876 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:31:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:31:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -914584257, now seen corresponding path program 1 times [2019-11-21 12:31:27,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:31:27,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [404391231] [2019-11-21 12:31:27,887 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:31:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:31:28,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 12:31:28,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:31:28,226 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:31:28,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:31:28,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:31:28,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:31:28,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:31:28,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:31:28,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-21 12:31:28,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:31:28,403 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 12:31:28,404 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:31:28,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-21 12:31:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:31:28,439 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:31:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:31:32,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [404391231] [2019-11-21 12:31:32,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:31:32,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-21 12:31:32,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700268332] [2019-11-21 12:31:32,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 12:31:32,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:31:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 12:31:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2019-11-21 12:31:32,871 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 13 states. [2019-11-21 12:32:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:32:11,143 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2019-11-21 12:32:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 12:32:11,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-11-21 12:32:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:32:11,147 INFO L225 Difference]: With dead ends: 233 [2019-11-21 12:32:11,148 INFO L226 Difference]: Without dead ends: 233 [2019-11-21 12:32:11,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=84, Invalid=295, Unknown=1, NotChecked=0, Total=380 [2019-11-21 12:32:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-21 12:32:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 119. [2019-11-21 12:32:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-21 12:32:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2019-11-21 12:32:11,165 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 19 [2019-11-21 12:32:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:32:11,166 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2019-11-21 12:32:11,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 12:32:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2019-11-21 12:32:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:32:11,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:32:11,167 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:32:11,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:32:11,369 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:32:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:32:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash -914584256, now seen corresponding path program 1 times [2019-11-21 12:32:11,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:32:11,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [666212915] [2019-11-21 12:32:11,370 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:32:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:32:11,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 12:32:11,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:32:11,662 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:32:11,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:32:11,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:32:11,682 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:32:11,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:32:11,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:32:11,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:32:11,695 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:32:13,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:32:13,886 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:32:13,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:32:13,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:32:13,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:32:13,918 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 13 treesize of output 17 [2019-11-21 12:32:13,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:32:13,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:32:13,940 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:32:13,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2019-11-21 12:32:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:32:13,963 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:32:14,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:32:14,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:32:14,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:32:14,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:32:14,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:32:14,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:32:14,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:32:14,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:32:14,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:32:19,734 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 12:32:19,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:32:25,283 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 12:32:25,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 12:32:25,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:32:25,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:32:25,316 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:32:25,317 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:32:25,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:32:25,328 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:32:25,328 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:8 [2019-11-21 12:32:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:32:25,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [666212915] [2019-11-21 12:32:25,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:32:25,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-21 12:32:25,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206793998] [2019-11-21 12:32:25,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 12:32:25,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:32:25,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 12:32:25,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=199, Unknown=4, NotChecked=0, Total=240 [2019-11-21 12:32:25,410 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 16 states. [2019-11-21 12:32:31,654 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~a10~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse0 (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvsle .cse0 (select |c_#length| v_entry_point_~a10~0.base_BEFORE_CALL_4)) (not (bvsle (_ bv0 32) v_entry_point_~a10~0.offset_BEFORE_CALL_2)) (not (bvsle v_entry_point_~a10~0.offset_BEFORE_CALL_2 .cse0)) (exists ((v_prenex_1 (_ BitVec 32)) (v_ldv_malloc_~size_25 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_1 v_ldv_malloc_~size_25) v_entry_point_~a10~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_1))))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))) is different from false [2019-11-21 12:32:43,883 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#t~malloc12.base_21| (_ BitVec 32)) (v_entry_point_~a10~0.base_BEFORE_CALL_4 (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse0 (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvsle .cse0 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_21| ldv_malloc_~size) v_entry_point_~a10~0.base_BEFORE_CALL_4)) (not (bvsle (_ bv0 32) v_entry_point_~a10~0.offset_BEFORE_CALL_2)) (not (bvsle v_entry_point_~a10~0.offset_BEFORE_CALL_2 .cse0)) (exists ((v_prenex_1 (_ BitVec 32)) (v_ldv_malloc_~size_25 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_1 v_ldv_malloc_~size_25) v_entry_point_~a10~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_1)))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_21|) (_ bv0 1)))))) (forall ((v_entry_point_~a10~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse1 (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvsle .cse1 (select |c_#length| v_entry_point_~a10~0.base_BEFORE_CALL_4)) (not (bvsle (_ bv0 32) v_entry_point_~a10~0.offset_BEFORE_CALL_2)) (not (bvsle v_entry_point_~a10~0.offset_BEFORE_CALL_2 .cse1)) (exists ((v_prenex_1 (_ BitVec 32)) (v_ldv_malloc_~size_25 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_1 v_ldv_malloc_~size_25) v_entry_point_~a10~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_1))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))) is different from false [2019-11-21 12:32:47,920 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~a10~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse0 (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvsle .cse0 (select |c_#length| v_entry_point_~a10~0.base_BEFORE_CALL_4)) (not (bvsle (_ bv0 32) v_entry_point_~a10~0.offset_BEFORE_CALL_2)) (not (bvsle v_entry_point_~a10~0.offset_BEFORE_CALL_2 .cse0)) (exists ((v_prenex_1 (_ BitVec 32)) (v_ldv_malloc_~size_25 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_1 v_ldv_malloc_~size_25) v_entry_point_~a10~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_1))))))) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))) is different from false [2019-11-21 12:32:58,420 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-11-21 12:33:08,289 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-11-21 12:33:18,634 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 43 DAG size of output: 16 [2019-11-21 12:34:04,683 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd c_entry_point_~a10~0.offset (_ bv4 32)))) (let ((.cse1 (bvsle c_entry_point_~a10~0.offset .cse2)) (.cse0 (bvsle (_ bv0 32) c_entry_point_~a10~0.offset)) (.cse4 (forall ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_20|) (_ bv0 1)))))) (and .cse0 .cse1 (bvsle .cse2 (select |c_#length| c_entry_point_~a10~0.base)) (forall ((v_entry_point_~a10~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse3 (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvsle .cse3 (select |c_#length| v_entry_point_~a10~0.base_BEFORE_CALL_4)) (not (bvsle (_ bv0 32) v_entry_point_~a10~0.offset_BEFORE_CALL_2)) (not (bvsle v_entry_point_~a10~0.offset_BEFORE_CALL_2 .cse3)) (exists ((v_prenex_1 (_ BitVec 32)) (v_ldv_malloc_~size_25 (_ BitVec 32))) (and (not (bvsle (bvadd v_entry_point_~a10~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_1 v_ldv_malloc_~size_25) v_entry_point_~a10~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_1))))))) (or .cse1 .cse4) (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|) (or .cse0 .cse4) (forall ((v_ldv_malloc_~size_25 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_20|) (_ bv0 1))) (bvsle (bvadd c_entry_point_~a10~0.offset (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_20| v_ldv_malloc_~size_25) c_entry_point_~a10~0.base)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))))) is different from false [2019-11-21 12:35:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:35:08,352 INFO L93 Difference]: Finished difference Result 210 states and 241 transitions. [2019-11-21 12:35:08,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-21 12:35:08,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-11-21 12:35:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:35:08,356 INFO L225 Difference]: With dead ends: 210 [2019-11-21 12:35:08,356 INFO L226 Difference]: Without dead ends: 210 [2019-11-21 12:35:08,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=69, Invalid=315, Unknown=12, NotChecked=156, Total=552 [2019-11-21 12:35:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-21 12:35:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 149. [2019-11-21 12:35:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-21 12:35:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 194 transitions. [2019-11-21 12:35:08,376 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 194 transitions. Word has length 19 [2019-11-21 12:35:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:35:08,376 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 194 transitions. [2019-11-21 12:35:08,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 12:35:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2019-11-21 12:35:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:35:08,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:35:08,378 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:35:08,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:35:08,582 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:35:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:35:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1583431680, now seen corresponding path program 1 times [2019-11-21 12:35:08,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:35:08,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1532426247] [2019-11-21 12:35:08,584 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:35:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:35:08,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:35:08,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:35:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:35:08,888 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:35:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 12:35:08,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1532426247] [2019-11-21 12:35:08,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 12:35:08,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2019-11-21 12:35:08,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338800909] [2019-11-21 12:35:08,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:35:08,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:35:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:35:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:35:08,947 INFO L87 Difference]: Start difference. First operand 149 states and 194 transitions. Second operand 5 states. [2019-11-21 12:35:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:35:09,020 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2019-11-21 12:35:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:35:09,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 12:35:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:35:09,022 INFO L225 Difference]: With dead ends: 136 [2019-11-21 12:35:09,023 INFO L226 Difference]: Without dead ends: 134 [2019-11-21 12:35:09,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:35:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-21 12:35:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-21 12:35:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-21 12:35:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2019-11-21 12:35:09,036 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 19 [2019-11-21 12:35:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:35:09,037 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2019-11-21 12:35:09,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:35:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2019-11-21 12:35:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 12:35:09,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:35:09,038 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:35:09,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:35:09,244 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:35:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:35:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash -565608548, now seen corresponding path program 1 times [2019-11-21 12:35:09,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:35:09,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1078648587] [2019-11-21 12:35:09,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 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:35:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:35:09,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:35:09,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:35:09,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 12:35:09,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:09,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:09,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:35:09,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-21 12:35:09,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-21 12:35:09,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:09,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:09,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:35:09,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-21 12:35:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 12:35:09,569 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:35:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 12:35:09,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1078648587] [2019-11-21 12:35:09,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:35:09,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-21 12:35:09,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462742921] [2019-11-21 12:35:09,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:35:09,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:35:09,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:35:09,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:35:09,604 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand 6 states. [2019-11-21 12:35:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:35:09,773 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2019-11-21 12:35:09,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:35:09,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-21 12:35:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:35:09,776 INFO L225 Difference]: With dead ends: 137 [2019-11-21 12:35:09,776 INFO L226 Difference]: Without dead ends: 137 [2019-11-21 12:35:09,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-21 12:35:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-21 12:35:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-11-21 12:35:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-21 12:35:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 169 transitions. [2019-11-21 12:35:09,787 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 169 transitions. Word has length 24 [2019-11-21 12:35:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:35:09,787 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 169 transitions. [2019-11-21 12:35:09,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:35:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 169 transitions. [2019-11-21 12:35:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 12:35:09,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:35:09,788 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:35:09,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:35:09,992 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:35:09,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:35:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1921904285, now seen corresponding path program 1 times [2019-11-21 12:35:09,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:35:09,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1624498432] [2019-11-21 12:35:09,993 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:35:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:35:10,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:35:10,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:35:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 12:35:10,325 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:35:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 12:35:10,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1624498432] [2019-11-21 12:35:10,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:35:10,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-21 12:35:10,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439179631] [2019-11-21 12:35:10,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 12:35:10,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:35:10,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 12:35:10,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 12:35:10,407 INFO L87 Difference]: Start difference. First operand 134 states and 169 transitions. Second operand 9 states. [2019-11-21 12:35:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:35:10,781 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2019-11-21 12:35:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:35:10,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-21 12:35:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:35:10,784 INFO L225 Difference]: With dead ends: 133 [2019-11-21 12:35:10,784 INFO L226 Difference]: Without dead ends: 133 [2019-11-21 12:35:10,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 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:35:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-21 12:35:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-21 12:35:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-21 12:35:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 167 transitions. [2019-11-21 12:35:10,794 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 167 transitions. Word has length 24 [2019-11-21 12:35:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:35:10,795 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 167 transitions. [2019-11-21 12:35:10,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 12:35:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2019-11-21 12:35:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 12:35:10,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:35:10,797 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:35:11,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:35:11,008 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:35:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:35:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2014259398, now seen corresponding path program 1 times [2019-11-21 12:35:11,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:35:11,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1472785194] [2019-11-21 12:35:11,010 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:35:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:35:11,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 12:35:11,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:35:11,329 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:35:11,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:11,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:11,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:35:11,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:35:11,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 12:35:11,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:11,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:11,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:35:11,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-11-21 12:35:11,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-21 12:35:11,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:11,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:11,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:35:11,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-11-21 12:35:11,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:11,532 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:35:11,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:11,555 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 12:35:11,556 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:35:11,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 12:35:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 12:35:11,587 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:35:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 12:35:14,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1472785194] [2019-11-21 12:35:14,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:35:14,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-21 12:35:14,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939009495] [2019-11-21 12:35:14,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-21 12:35:14,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:35:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-21 12:35:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-21 12:35:14,063 INFO L87 Difference]: Start difference. First operand 133 states and 167 transitions. Second operand 17 states. [2019-11-21 12:35:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:35:51,625 INFO L93 Difference]: Finished difference Result 173 states and 212 transitions. [2019-11-21 12:35:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-21 12:35:51,626 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-11-21 12:35:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:35:51,629 INFO L225 Difference]: With dead ends: 173 [2019-11-21 12:35:51,629 INFO L226 Difference]: Without dead ends: 173 [2019-11-21 12:35:51,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-11-21 12:35:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-21 12:35:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-11-21 12:35:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-21 12:35:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2019-11-21 12:35:51,639 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 29 [2019-11-21 12:35:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:35:51,640 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 168 transitions. [2019-11-21 12:35:51,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-21 12:35:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 168 transitions. [2019-11-21 12:35:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 12:35:51,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:35:51,642 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:35:51,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:35:51,843 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:35:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:35:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2014259399, now seen corresponding path program 1 times [2019-11-21 12:35:51,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:35:51,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [867207860] [2019-11-21 12:35:51,846 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:35:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:35:52,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 12:35:52,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:35:52,164 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:35:52,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:52,176 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:35:52,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:52,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,185 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:35:52,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 12:35:52,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:52,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 12:35:52,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:52,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:30 [2019-11-21 12:35:52,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-11-21 12:35:52,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:52,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 12:35:52,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:52,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:35:52,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2019-11-21 12:35:54,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:35:54,414 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 12 treesize of output 14 [2019-11-21 12:35:54,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:54,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:54,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:54,444 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 13 treesize of output 17 [2019-11-21 12:35:54,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:35:54,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:35:54,456 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:35:54,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2019-11-21 12:35:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:35:54,481 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:35:54,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:56,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:56,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:56,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:56,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:56,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:35:56,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:56,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:56,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:35:59,625 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 12:35:59,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:36:08,255 WARN L192 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-11-21 12:36:10,961 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 12:36:10,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 12:36:10,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:36:10,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:36:10,991 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:36:10,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:36:11,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:36:11,009 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:36:11,009 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:8 [2019-11-21 12:36:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:36:11,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [867207860] [2019-11-21 12:36:11,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:36:11,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-21 12:36:11,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012808165] [2019-11-21 12:36:11,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 12:36:11,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:36:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 12:36:11,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=257, Unknown=7, NotChecked=0, Total=306 [2019-11-21 12:36:11,144 INFO L87 Difference]: Start difference. First operand 134 states and 168 transitions. Second operand 18 states. [2019-11-21 12:37:25,635 WARN L192 SmtUtils]: Spent 39.61 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-21 12:38:04,365 WARN L192 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 43 DAG size of output: 16 [2019-11-21 12:38:13,513 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_entry_point_#t~mem47.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse0 (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (exists ((v_prenex_7 (_ BitVec 32)) (v_ldv_malloc_~size_61 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_7)) (not (bvsle (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| v_prenex_7 v_ldv_malloc_~size_61) |v_entry_point_#t~mem47.base_BEFORE_CALL_4|))))) (not (bvsle (_ bv0 32) |v_entry_point_#t~mem47.offset_BEFORE_CALL_2|)) (bvsle .cse0 (select |c_#length| |v_entry_point_#t~mem47.base_BEFORE_CALL_4|)) (not (bvsle |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| .cse0))))) (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|))) (forall ((|v_ldv_malloc_#t~malloc12.base_54| (_ BitVec 32)) (|v_entry_point_#t~mem47.base_BEFORE_CALL_4| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (|v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse1 (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_54|) (_ bv0 1))) (exists ((v_prenex_7 (_ BitVec 32)) (v_ldv_malloc_~size_61 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_7)) (not (bvsle (bvadd |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| v_prenex_7 v_ldv_malloc_~size_61) |v_entry_point_#t~mem47.base_BEFORE_CALL_4|))))) (not (bvsle (_ bv0 32) |v_entry_point_#t~mem47.offset_BEFORE_CALL_2|)) (bvsle .cse1 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_54| ldv_malloc_~size) |v_entry_point_#t~mem47.base_BEFORE_CALL_4|)) (not (bvsle |v_entry_point_#t~mem47.offset_BEFORE_CALL_2| .cse1))))) (exists ((|v_ldv_malloc_#t~malloc12.base_53| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_53|) (_ bv0 1)))) is different from false [2019-11-21 12:38:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:38:44,946 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2019-11-21 12:38:44,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-21 12:38:44,947 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-11-21 12:38:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:38:44,949 INFO L225 Difference]: With dead ends: 137 [2019-11-21 12:38:44,949 INFO L226 Difference]: Without dead ends: 137 [2019-11-21 12:38:44,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 95.2s TimeCoverageRelationStatistics Valid=85, Invalid=451, Unknown=20, NotChecked=44, Total=600 [2019-11-21 12:38:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-21 12:38:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-11-21 12:38:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-21 12:38:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2019-11-21 12:38:44,957 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 29 [2019-11-21 12:38:44,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:38:44,957 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2019-11-21 12:38:44,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 12:38:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2019-11-21 12:38:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 12:38:44,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:38:44,959 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:38:45,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:38:45,163 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, alloc_10Err2REQUIRES_VIOLATION, alloc_10Err3REQUIRES_VIOLATION, alloc_10Err4REQUIRES_VIOLATION, alloc_10Err5REQUIRES_VIOLATION, alloc_10Err0REQUIRES_VIOLATION, alloc_10Err1REQUIRES_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, free_10Err4REQUIRES_VIOLATION, free_10Err3REQUIRES_VIOLATION, free_10Err2REQUIRES_VIOLATION, free_10Err1REQUIRES_VIOLATION, free_10Err0REQUIRES_VIOLATION, free_10Err8ASSERT_VIOLATIONMEMORY_FREE, free_10Err6ASSERT_VIOLATIONMEMORY_FREE, free_10Err7ASSERT_VIOLATIONMEMORY_FREE, free_10Err5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr18ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11REQUIRES_VIOLATION, entry_pointErr10REQUIRES_VIOLATION, entry_pointErr12REQUIRES_VIOLATION, entry_pointErr25ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr13REQUIRES_VIOLATION, entry_pointErr15REQUIRES_VIOLATION, entry_pointErr14REQUIRES_VIOLATION, entry_pointErr5REQUIRES_VIOLATION, entry_pointErr22ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr7REQUIRES_VIOLATION, entry_pointErr6REQUIRES_VIOLATION, entry_pointErr8REQUIRES_VIOLATION, entry_pointErr16ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr26ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr24ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4REQUIRES_VIOLATION, entry_pointErr23ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr19REQUIRES_VIOLATION, entry_pointErr17ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr20REQUIRES_VIOLATION, entry_pointErr21ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:38:45,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:38:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2023525421, now seen corresponding path program 1 times [2019-11-21 12:38:45,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:38:45,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [448841798] [2019-11-21 12:38:45,165 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:38:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:38:45,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 12:38:45,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:38:45,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:38:45,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 37 [2019-11-21 12:38:45,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:38:45,502 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-21 12:38:45,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:38:45,503 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:38:45,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-21 12:38:45,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:38:45,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:38:45,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:38:45,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:38:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-21 12:38:51,741 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:38:56,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:38:56,082 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:38:56,088 INFO L168 Benchmark]: Toolchain (without parser) took 453113.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 953.7 MB in the beginning and 1.2 GB in the end (delta: -250.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-21 12:38:56,089 INFO L168 Benchmark]: CDTParser took 0.26 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:38:56,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 923.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-21 12:38:56,090 INFO L168 Benchmark]: Boogie Preprocessor took 120.04 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:38:56,090 INFO L168 Benchmark]: RCFGBuilder took 1761.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 947.7 MB in the end (delta: 120.9 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. [2019-11-21 12:38:56,091 INFO L168 Benchmark]: TraceAbstraction took 450304.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 947.7 MB in the beginning and 1.2 GB in the end (delta: -255.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:38:56,093 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.26 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 923.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.04 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 1761.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 947.7 MB in the end (delta: 120.9 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 450304.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 947.7 MB in the beginning and 1.2 GB in the end (delta: -255.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...