./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.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_test13.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 50623fcce85e4b85b0accc998d09712632377f90 --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:53:44,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:53:44,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:53:44,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:53:44,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:53:44,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:53:44,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:53:44,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:53:44,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:53:44,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:53:44,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:53:44,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:53:44,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:53:44,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:53:44,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:53:44,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:53:44,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:53:44,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:53:44,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:53:44,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:53:44,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:53:44,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:53:44,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:53:44,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:53:44,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:53:44,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:53:44,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:53:44,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:53:44,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:53:44,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:53:44,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:53:44,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:53:44,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:53:44,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:53:44,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:53:44,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:53:44,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:53:44,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:53:44,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:53:44,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:53:44,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:53:44,603 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:53:44,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:53:44,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:53:44,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:53:44,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:53:44,620 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:53:44,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:53:44,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:53:44,621 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:53:44,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:53:44,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:53:44,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:53:44,622 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:53:44,622 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:53:44,622 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:53:44,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:53:44,623 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:53:44,623 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:44,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:53:44,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:53:44,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:53:44,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:53:44,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:53:44,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:53:44,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:53:44,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:53:44,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:53:44,625 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:53:44,625 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:53:44,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:53:44,626 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 -> 50623fcce85e4b85b0accc998d09712632377f90 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:53:44,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:53:44,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:53:44,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:53:44,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:53:44,944 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:53:44,945 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2019-11-21 12:53:45,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d4df1b8/0a80707d3b884518a7db4fb0d06d3a9d/FLAG203c77bf5 [2019-11-21 12:53:45,556 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:53:45,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2019-11-21 12:53:45,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d4df1b8/0a80707d3b884518a7db4fb0d06d3a9d/FLAG203c77bf5 [2019-11-21 12:53:45,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d4df1b8/0a80707d3b884518a7db4fb0d06d3a9d [2019-11-21 12:53:45,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:53:45,860 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:53:45,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:53:45,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:53:45,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:53:45,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:53:45" (1/1) ... [2019-11-21 12:53:45,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68275591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:45, skipping insertion in model container [2019-11-21 12:53:45,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:53:45" (1/1) ... [2019-11-21 12:53:45,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:53:45,936 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:53:46,395 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:53:46,395 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 12:53:46,396 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,423 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:53:46,424 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 12:53:46,424 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,428 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:53:46,429 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 12:53:46,429 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,434 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:53:46,434 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 12:53:46,434 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,473 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:53:46,473 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 12:53:46,474 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,494 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:53:46,495 INFO L969 CHandler]: at location: C: (struct A13 *)ldv_malloc(sizeof(struct A13)) [764] [2019-11-21 12:53:46,495 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,511 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:53:46,511 INFO L969 CHandler]: at location: C: (typeof(*p) *)( (char *)__mptr - ((size_t) &((typeof(*p) *)0)->list) ) [772] [2019-11-21 12:53:46,512 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,516 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:53:46,517 INFO L969 CHandler]: at location: C: (typeof(*(p)) *)( (char *)__mptr - ((size_t) &((typeof(*(p)) *)0)->list) ) [772] [2019-11-21 12:53:46,517 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,522 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:53:46,524 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [772] [2019-11-21 12:53:46,525 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:53:46,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:53:46,551 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:53:46,576 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:53:46,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:53:46,656 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:53:46,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:53:46,805 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:53:46,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46 WrapperNode [2019-11-21 12:53:46,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:53:46,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:53:46,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:53:46,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:53:46,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (1/1) ... [2019-11-21 12:53:46,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (1/1) ... [2019-11-21 12:53:46,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (1/1) ... [2019-11-21 12:53:46,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (1/1) ... [2019-11-21 12:53:46,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (1/1) ... [2019-11-21 12:53:46,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (1/1) ... [2019-11-21 12:53:46,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (1/1) ... [2019-11-21 12:53:46,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:53:46,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:53:46,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:53:46,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:53:46,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (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:53:46,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:53:46,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:53:46,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:53:46,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:53:46,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:53:46,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 12:53:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 12:53:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 12:53:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 12:53:47,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 12:53:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 12:53:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 12:53:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:53:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 12:53:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 12:53:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 12:53:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 12:53:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 12:53:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 12:53:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 12:53:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 12:53:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 12:53:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 12:53:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 12:53:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 12:53:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 12:53:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 12:53:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 12:53:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 12:53:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 12:53:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 12:53:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 12:53:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 12:53:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 12:53:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 12:53:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 12:53:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 12:53:47,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 12:53:47,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 12:53:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 12:53:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 12:53:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-11-21 12:53:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2019-11-21 12:53:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 12:53:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:53:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 12:53:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 12:53:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 12:53:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:53:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:53:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:53:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:53:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:53:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:53:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:53:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:53:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:53:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:53:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:53:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:53:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:53:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:53:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:53:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:53:47,023 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:53:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:53:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 12:53:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 12:53:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 12:53:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:53:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:53:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:53:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:53:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:53:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:53:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:53:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:53:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:53:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:53:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:53:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:53:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:53:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:53:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:53:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:53:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:53:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:53:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:53:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:53:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:53:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:53:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:53:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:53:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:53:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:53:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:53:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:53:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:53:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:53:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:53:47,036 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:53:47,037 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:53:47,037 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:53:47,037 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:53:47,037 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:53:47,037 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:53:47,038 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:53:47,038 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:53:47,038 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:53:47,038 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:53:47,039 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:53:47,039 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:53:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:53:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:53:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:53:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:53:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:53:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:53:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:53:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:53:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:53:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:53:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:53:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:53:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:53:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:53:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:53:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:53:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:53:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:53:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:53:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:53:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:53:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:53:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:53:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:53:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:53:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:53:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:53:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:53:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:53:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:53:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:53:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:53:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:53:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:53:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:53:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:53:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:53:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:53:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:53:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:53:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:53:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:53:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:53:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 12:53:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:53:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 12:53:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 12:53:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 12:53:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 12:53:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 12:53:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 12:53:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:53:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 12:53:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 12:53:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:53:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:53:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 12:53:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 12:53:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 12:53:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:53:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 12:53:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 12:53:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 12:53:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 12:53:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 12:53:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 12:53:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:53:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 12:53:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 12:53:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 12:53:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 12:53:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 12:53:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:53:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:53:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 12:53:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 12:53:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:53:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 12:53:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 12:53:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 12:53:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 12:53:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 12:53:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 12:53:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 12:53:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 12:53:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 12:53:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 12:53:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 12:53:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 12:53:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 12:53:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 12:53:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-11-21 12:53:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2019-11-21 12:53:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 12:53:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:53:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:53:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 12:53:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 12:53:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:53:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 12:53:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 12:53:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 12:53:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 12:53:47,772 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:53:48,152 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:53:48,545 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:53:48,545 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-21 12:53:48,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:53:48 BoogieIcfgContainer [2019-11-21 12:53:48,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:53:48,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:53:48,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:53:48,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:53:48,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:53:45" (1/3) ... [2019-11-21 12:53:48,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456215dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:53:48, skipping insertion in model container [2019-11-21 12:53:48,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:53:46" (2/3) ... [2019-11-21 12:53:48,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456215dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:53:48, skipping insertion in model container [2019-11-21 12:53:48,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:53:48" (3/3) ... [2019-11-21 12:53:48,555 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2019-11-21 12:53:48,565 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:53:48,573 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-11-21 12:53:48,587 INFO L249 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-11-21 12:53:48,611 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:53:48,612 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:53:48,612 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:53:48,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:53:48,612 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:53:48,612 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:53:48,613 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:53:48,613 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:53:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-21 12:53:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 12:53:48,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:53:48,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:53:48,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:53:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:53:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash 797453636, now seen corresponding path program 1 times [2019-11-21 12:53:48,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:53:48,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [578052328] [2019-11-21 12:53:48,672 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:53:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:53:49,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 12:53:49,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:53:49,220 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:53:49,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:53:49,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:53:49,276 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2019-11-21 12:53:49,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:53:49,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:53:49,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:32 [2019-11-21 12:53:49,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:53:49,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:53:49,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:53:49,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:53:49,330 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:53:49,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-21 12:53:49,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:53:49,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:53:49,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:53:49,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:53:49,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 12:53:49,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:53:49,444 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:53:49,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:53:49,472 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 12:53:49,473 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:53:49,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-21 12:53:49,603 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:53:49,604 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:53:49,951 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:53:49,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [578052328] [2019-11-21 12:53:49,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:53:49,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-21 12:53:49,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73557814] [2019-11-21 12:53:49,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:53:49,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:53:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:53:49,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:53:49,977 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 14 states. [2019-11-21 12:54:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:54:04,466 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2019-11-21 12:54:04,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:54:04,468 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-21 12:54:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:54:04,482 INFO L225 Difference]: With dead ends: 208 [2019-11-21 12:54:04,482 INFO L226 Difference]: Without dead ends: 195 [2019-11-21 12:54:04,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-11-21 12:54:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-21 12:54:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 109. [2019-11-21 12:54:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 12:54:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-21 12:54:04,541 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 17 [2019-11-21 12:54:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:54:04,542 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-21 12:54:04,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:54:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-21 12:54:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 12:54:04,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:54:04,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:54:04,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:54:04,747 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:54:04,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:54:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash 797453637, now seen corresponding path program 1 times [2019-11-21 12:54:04,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:54:04,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1215269523] [2019-11-21 12:54:04,750 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:54:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:54:05,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-21 12:54:05,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:54:05,058 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:54:05,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 12:54:05,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:54:05,141 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:54:05,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:54:05,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,216 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-21 12:54:05,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:54:05,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:54:05,219 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:45 [2019-11-21 12:54:05,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:54:05,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:54:05,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:54:05,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2019-11-21 12:54:05,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-11-21 12:54:05,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,324 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 12:54:05,324 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:54:05,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-21 12:54:05,372 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:126, output treesize:66 [2019-11-21 12:54:05,505 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_1, |v_#valid_BEFORE_CALL_10|], 1=[v_prenex_2, |v_#length_BEFORE_CALL_4|]} [2019-11-21 12:54:05,511 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 25 treesize of output 23 [2019-11-21 12:54:05,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:54:05,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2019-11-21 12:54:05,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:54:05,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:54:05,606 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 20 treesize of output 24 [2019-11-21 12:54:05,607 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,678 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-21 12:54:05,689 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 15 treesize of output 13 [2019-11-21 12:54:05,689 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,725 INFO L567 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-21 12:54:05,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:54:05,726 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:10 [2019-11-21 12:54:07,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:54:07,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:54:07,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:54:07,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 59 [2019-11-21 12:54:07,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:07,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:54:07,906 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 30 treesize of output 32 [2019-11-21 12:54:07,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:08,000 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.1 percent of original size [2019-11-21 12:54:08,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:54:08,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2019-11-21 12:54:08,037 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:08,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:54:08,052 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 29 treesize of output 33 [2019-11-21 12:54:08,053 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:54:08,141 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-21 12:54:08,142 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:54:08,142 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:9 [2019-11-21 12:54:08,201 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:54:08,202 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:54:08,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:54:08,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:54:09,428 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-21 12:54:09,441 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 39 [2019-11-21 12:54:10,266 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:54:10,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1215269523] [2019-11-21 12:54:10,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:54:10,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-21 12:54:10,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761460967] [2019-11-21 12:54:10,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 12:54:10,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:54:10,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 12:54:10,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2019-11-21 12:54:10,271 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 15 states. [2019-11-21 12:54:25,344 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-11-21 12:55:39,439 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-21 12:55:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:55:47,864 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2019-11-21 12:55:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 12:55:47,865 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-11-21 12:55:47,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:55:47,868 INFO L225 Difference]: With dead ends: 197 [2019-11-21 12:55:47,868 INFO L226 Difference]: Without dead ends: 197 [2019-11-21 12:55:47,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=196, Invalid=499, Unknown=7, NotChecked=0, Total=702 [2019-11-21 12:55:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-21 12:55:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 107. [2019-11-21 12:55:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 12:55:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-21 12:55:47,886 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2019-11-21 12:55:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:55:47,886 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-21 12:55:47,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 12:55:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-21 12:55:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:55:47,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:55:47,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:55:48,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:55:48,094 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:55:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:55:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1477528223, now seen corresponding path program 1 times [2019-11-21 12:55:48,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:55:48,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2044711613] [2019-11-21 12:55:48,095 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:55:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:55:48,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-21 12:55:48,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:55:48,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:55:48,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:48,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:48,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:55:48,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2019-11-21 12:55:48,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:55:48,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:48,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:48,512 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:55:48,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-11-21 12:55:48,560 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:55:48,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:55:48,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:48,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-21 12:55:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:55:48,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:48,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:48,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:55:48,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-21 12:55:48,714 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:55:48,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2044711613] [2019-11-21 12:55:48,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:55:48,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2019-11-21 12:55:48,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768713371] [2019-11-21 12:55:48,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 12:55:48,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:55:48,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 12:55:48,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:55:48,716 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 12 states. [2019-11-21 12:55:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:55:49,697 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2019-11-21 12:55:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:55:49,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-21 12:55:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:55:49,701 INFO L225 Difference]: With dead ends: 150 [2019-11-21 12:55:49,701 INFO L226 Difference]: Without dead ends: 150 [2019-11-21 12:55:49,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-11-21 12:55:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-21 12:55:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 106. [2019-11-21 12:55:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 12:55:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-21 12:55:49,713 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 20 [2019-11-21 12:55:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:55:49,713 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-21 12:55:49,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 12:55:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-21 12:55:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:55:49,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:55:49,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:55:49,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:55:49,918 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:55:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:55:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1477528224, now seen corresponding path program 1 times [2019-11-21 12:55:49,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:55:49,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [106971322] [2019-11-21 12:55:49,921 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:55:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:55:50,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-21 12:55:50,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:55:50,271 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:55:50,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 12:55:50,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:50,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:50,373 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:55:50,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:55:50,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:50,450 INFO L567 ElimStorePlain]: treesize reduction 10, result has 87.2 percent of original size [2019-11-21 12:55:50,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:50,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:55:50,452 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:68 [2019-11-21 12:55:50,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:50,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:50,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:50,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:50,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:50,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:50,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:50,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:50,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 91 [2019-11-21 12:55:50,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:50,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:50,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 70 [2019-11-21 12:55:50,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:50,631 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 12:55:50,631 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:50,801 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-21 12:55:50,802 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.0 percent of original size [2019-11-21 12:55:50,820 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:50,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2019-11-21 12:55:50,821 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:50,829 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 12:55:50,830 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:50,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:50,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:55:50,854 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:211, output treesize:42 [2019-11-21 12:55:52,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:53,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:53,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 87 [2019-11-21 12:55:53,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:53,043 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:55:53,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:55:53,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:53,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 78 [2019-11-21 12:55:53,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:53,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:53,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 118 [2019-11-21 12:55:53,137 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:53,408 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-21 12:55:53,410 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.9 percent of original size [2019-11-21 12:55:53,445 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:53,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 73 [2019-11-21 12:55:53,447 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:53,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:53,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 75 [2019-11-21 12:55:53,476 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:53,715 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-21 12:55:53,716 INFO L567 ElimStorePlain]: treesize reduction 22, result has 84.8 percent of original size [2019-11-21 12:55:53,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-21 12:55:53,718 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:224, output treesize:97 [2019-11-21 12:55:53,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:55:53,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:53,919 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.5 percent of original size [2019-11-21 12:55:53,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:55:53,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:55:53,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:55:53,931 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:55:53,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:9 [2019-11-21 12:55:54,011 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:55:54,011 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:55:54,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:55,055 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:55:57,560 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 12:55:57,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:55:57,580 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-21 12:56:00,184 WARN L192 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-21 12:56:00,203 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-21 12:56:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:56:06,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [106971322] [2019-11-21 12:56:06,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:56:06,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2019-11-21 12:56:06,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793001904] [2019-11-21 12:56:06,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 12:56:06,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:56:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 12:56:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=326, Unknown=2, NotChecked=0, Total=380 [2019-11-21 12:56:06,765 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 20 states. [2019-11-21 12:56:16,077 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-21 12:56:18,326 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 12:56:23,216 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 12:56:27,595 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-21 12:56:41,583 WARN L192 SmtUtils]: Spent 971.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-21 12:56:43,140 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 12:57:01,645 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:57:14,410 WARN L192 SmtUtils]: Spent 962.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-21 12:57:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:41,292 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-21 12:57:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 12:57:41,296 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-11-21 12:57:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:41,297 INFO L225 Difference]: With dead ends: 152 [2019-11-21 12:57:41,297 INFO L226 Difference]: Without dead ends: 152 [2019-11-21 12:57:41,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=242, Invalid=946, Unknown=2, NotChecked=0, Total=1190 [2019-11-21 12:57:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-21 12:57:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 105. [2019-11-21 12:57:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-21 12:57:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-21 12:57:41,309 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2019-11-21 12:57:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:41,310 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-21 12:57:41,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 12:57:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-21 12:57:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:57:41,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:41,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:41,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:41,513 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:57:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:41,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1441265296, now seen corresponding path program 1 times [2019-11-21 12:57:41,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:41,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1362950967] [2019-11-21 12:57:41,515 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:57:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:41,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 12:57:41,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:41,799 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:57:41,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:41,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:41,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:57:41,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:57:41,883 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:57:41,883 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:42,029 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:57:42,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1362950967] [2019-11-21 12:57:42,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:42,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 13 [2019-11-21 12:57:42,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111885358] [2019-11-21 12:57:42,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:57:42,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:42,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:57:42,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:57:42,031 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 14 states. [2019-11-21 12:57:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:42,855 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-21 12:57:42,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:57:42,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-21 12:57:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:42,857 INFO L225 Difference]: With dead ends: 121 [2019-11-21 12:57:42,858 INFO L226 Difference]: Without dead ends: 121 [2019-11-21 12:57:42,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:57:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-21 12:57:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-11-21 12:57:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-21 12:57:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-11-21 12:57:42,879 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 21 [2019-11-21 12:57:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:42,879 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-11-21 12:57:42,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:57:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-11-21 12:57:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:57:42,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:42,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:43,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:43,098 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:57:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1441265295, now seen corresponding path program 1 times [2019-11-21 12:57:43,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:43,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1482699583] [2019-11-21 12:57:43,100 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:57:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:43,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 12:57:43,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:43,428 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:57:43,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:43,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:43,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:57:43,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:57:43,562 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:57:43,563 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:44,251 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:57:44,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1482699583] [2019-11-21 12:57:44,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:44,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-21 12:57:44,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194270961] [2019-11-21 12:57:44,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 12:57:44,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 12:57:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-21 12:57:44,254 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 18 states. [2019-11-21 12:57:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:46,132 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-11-21 12:57:46,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:57:46,134 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-21 12:57:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:46,136 INFO L225 Difference]: With dead ends: 119 [2019-11-21 12:57:46,136 INFO L226 Difference]: Without dead ends: 119 [2019-11-21 12:57:46,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-21 12:57:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-21 12:57:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-11-21 12:57:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-21 12:57:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-11-21 12:57:46,143 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 21 [2019-11-21 12:57:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:46,144 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-11-21 12:57:46,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 12:57:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-11-21 12:57:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:57:46,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:46,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:46,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:46,349 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:57:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1312182577, now seen corresponding path program 1 times [2019-11-21 12:57:46,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:46,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [816106456] [2019-11-21 12:57:46,351 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:57:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:46,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:57:46,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:46,693 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:57:46,694 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:46,734 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:57:46,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [816106456] [2019-11-21 12:57:46,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:46,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:57:46,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426624369] [2019-11-21 12:57:46,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:57:46,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:57:46,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:57:46,736 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 5 states. [2019-11-21 12:57:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:46,761 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-11-21 12:57:46,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:57:46,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-21 12:57:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:46,763 INFO L225 Difference]: With dead ends: 102 [2019-11-21 12:57:46,763 INFO L226 Difference]: Without dead ends: 102 [2019-11-21 12:57:46,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:57:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-21 12:57:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-21 12:57:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 12:57:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-21 12:57:46,776 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 21 [2019-11-21 12:57:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:46,779 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-21 12:57:46,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:57:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-21 12:57:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:57:46,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:46,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:46,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:46,987 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:57:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1200287389, now seen corresponding path program 1 times [2019-11-21 12:57:46,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:46,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [430208440] [2019-11-21 12:57:46,989 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:57:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:47,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:57:47,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:47,269 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:57:47,270 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:57:47,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [430208440] [2019-11-21 12:57:47,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:47,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:57:47,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115281946] [2019-11-21 12:57:47,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:57:47,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:47,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:57:47,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:57:47,339 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2019-11-21 12:57:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:47,351 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-11-21 12:57:47,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:57:47,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-21 12:57:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:47,353 INFO L225 Difference]: With dead ends: 100 [2019-11-21 12:57:47,353 INFO L226 Difference]: Without dead ends: 100 [2019-11-21 12:57:47,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:57:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-21 12:57:47,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-21 12:57:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 12:57:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-11-21 12:57:47,364 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 21 [2019-11-21 12:57:47,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:47,364 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-11-21 12:57:47,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:57:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-11-21 12:57:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:57:47,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:47,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:47,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:47,576 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:57:47,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1071204670, now seen corresponding path program 1 times [2019-11-21 12:57:47,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:47,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1101452062] [2019-11-21 12:57:47,577 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:57:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:47,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 12:57:47,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:47,894 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:57:47,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:57:47,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:47,948 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-11-21 12:57:47,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:57:47,950 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:57:47,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:39 [2019-11-21 12:57:47,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:57:47,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:57:47,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:48,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:48,026 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-21 12:57:48,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:57:48,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:48,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:48,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:57:48,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2019-11-21 12:57:48,069 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-21 12:57:48,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-21 12:57:48,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:48,081 INFO L567 ElimStorePlain]: treesize reduction 5, result has 64.3 percent of original size [2019-11-21 12:57:48,081 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:57:48,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:5 [2019-11-21 12:57:48,101 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:57:48,101 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:48,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:57:48,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:57:48,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:57:48,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-21 12:57:48,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:48,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2019-11-21 12:57:48,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:48,269 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 12:57:48,269 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:48,272 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 12:57:48,273 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:48,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:48,300 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_2| vanished before elimination [2019-11-21 12:57:48,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 12:57:48,302 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:54 [2019-11-21 12:57:48,415 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:57:48,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1101452062] [2019-11-21 12:57:48,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:48,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-21 12:57:48,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243633832] [2019-11-21 12:57:48,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:57:48,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:57:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:57:48,416 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 10 states. [2019-11-21 12:57:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:49,480 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-21 12:57:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:57:49,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-21 12:57:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:49,483 INFO L225 Difference]: With dead ends: 137 [2019-11-21 12:57:49,483 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 12:57:49,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-11-21 12:57:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 12:57:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-11-21 12:57:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 12:57:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-21 12:57:49,489 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2019-11-21 12:57:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:49,489 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-21 12:57:49,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:57:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-11-21 12:57:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:57:49,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:49,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:49,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:49,694 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:57:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:49,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1071204669, now seen corresponding path program 1 times [2019-11-21 12:57:49,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:49,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [493530440] [2019-11-21 12:57:49,696 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:57:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:49,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-21 12:57:49,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:50,002 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:57:50,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 12:57:50,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:50,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,021 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:57:50,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-11-21 12:57:50,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:57:50,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:50,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,089 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_7|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_17|]} [2019-11-21 12:57:50,098 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 12:57:50,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:50,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:57:50,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:57:50,128 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:50,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:57:50,138 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:13 [2019-11-21 12:57:50,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:57:50,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:50,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,183 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:57:50,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:50,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,194 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:57:50,194 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:9 [2019-11-21 12:57:50,225 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:57:50,225 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:50,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:57:50,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-11-21 12:57:50,581 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:57:50,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,635 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4| vanished before elimination [2019-11-21 12:57:50,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-11-21 12:57:50,648 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:57:50,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:50,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:57:50,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:54 [2019-11-21 12:57:50,897 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:57:50,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [493530440] [2019-11-21 12:57:50,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:50,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-21 12:57:50,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344287631] [2019-11-21 12:57:50,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 12:57:50,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:50,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 12:57:50,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:57:50,899 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 12 states. [2019-11-21 12:57:52,862 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:57:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:54,192 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-11-21 12:57:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 12:57:54,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-21 12:57:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:54,195 INFO L225 Difference]: With dead ends: 145 [2019-11-21 12:57:54,196 INFO L226 Difference]: Without dead ends: 145 [2019-11-21 12:57:54,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-11-21 12:57:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-21 12:57:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2019-11-21 12:57:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-21 12:57:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2019-11-21 12:57:54,202 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 21 [2019-11-21 12:57:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:54,203 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2019-11-21 12:57:54,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 12:57:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2019-11-21 12:57:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 12:57:54,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:54,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:54,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:54,409 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:57:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478541, now seen corresponding path program 1 times [2019-11-21 12:57:54,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:54,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [353518197] [2019-11-21 12:57:54,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:54,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:57:54,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:54,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:57:54,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:54,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:54,727 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:57:54,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2019-11-21 12:57:54,758 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:57:54,758 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:54,780 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:57:54,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [353518197] [2019-11-21 12:57:54,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:54,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 12:57:54,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624347297] [2019-11-21 12:57:54,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:57:54,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:57:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:57:54,782 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 6 states. [2019-11-21 12:57:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:57,282 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2019-11-21 12:57:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 12:57:57,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-21 12:57:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:57,285 INFO L225 Difference]: With dead ends: 136 [2019-11-21 12:57:57,285 INFO L226 Difference]: Without dead ends: 136 [2019-11-21 12:57:57,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:57:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-21 12:57:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2019-11-21 12:57:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-21 12:57:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2019-11-21 12:57:57,291 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 23 [2019-11-21 12:57:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:57,292 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2019-11-21 12:57:57,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:57:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2019-11-21 12:57:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 12:57:57,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:57,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:57,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:57,497 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:57:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:57,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478540, now seen corresponding path program 1 times [2019-11-21 12:57:57,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:57,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [359574365] [2019-11-21 12:57:57,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:57,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-21 12:57:57,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:57,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:57:57,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:57,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:57,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:57:57,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:57,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:57,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:57:57,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:10 [2019-11-21 12:57:58,086 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:57:58,086 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:58,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:57:58,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2019-11-21 12:57:58,170 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:57:58,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-11-21 12:57:58,191 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:57:58,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:58,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-11-21 12:57:58,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:57:58,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:57:58,211 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:57:58,317 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 12:57:58,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:58,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:57:58,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-21 12:57:58,318 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:85 [2019-11-21 12:57:58,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:57:58,599 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-21 12:57:58,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:57:58,949 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-21 12:57:59,201 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-21 12:57:59,455 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 12:57:59,750 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 12:58:00,025 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 12:58:00,114 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:58:00,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [359574365] [2019-11-21 12:58:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:00,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-21 12:58:00,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349063481] [2019-11-21 12:58:00,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 12:58:00,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 12:58:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:58:00,116 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 16 states. [2019-11-21 12:58:01,554 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:58:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:03,543 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2019-11-21 12:58:03,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:58:03,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-21 12:58:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:03,548 INFO L225 Difference]: With dead ends: 135 [2019-11-21 12:58:03,548 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 12:58:03,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-11-21 12:58:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 12:58:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2019-11-21 12:58:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-21 12:58:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2019-11-21 12:58:03,555 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 23 [2019-11-21 12:58:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:03,556 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2019-11-21 12:58:03,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 12:58:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2019-11-21 12:58:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 12:58:03,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:03,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:03,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:03,768 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:58:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1455614589, now seen corresponding path program 1 times [2019-11-21 12:58:03,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:03,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1262072179] [2019-11-21 12:58:03,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:04,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 12:58:04,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:04,122 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:58:04,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:58:04,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,171 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-11-21 12:58:04,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:04,172 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:58:04,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:39 [2019-11-21 12:58:04,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:04,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:58:04,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:04,233 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-21 12:58:04,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:04,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:04,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2019-11-21 12:58:04,267 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-21 12:58:04,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-21 12:58:04,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,278 INFO L567 ElimStorePlain]: treesize reduction 5, result has 64.3 percent of original size [2019-11-21 12:58:04,278 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:58:04,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:5 [2019-11-21 12:58:04,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:58:04,329 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:04,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:04,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:04,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-21 12:58:04,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2019-11-21 12:58:04,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,493 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 12:58:04,493 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,495 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 12:58:04,495 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:04,519 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_6| vanished before elimination [2019-11-21 12:58:04,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 12:58:04,519 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:54 [2019-11-21 12:58:04,650 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:58:04,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1262072179] [2019-11-21 12:58:04,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:04,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-21 12:58:04,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729368792] [2019-11-21 12:58:04,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 12:58:04,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:04,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 12:58:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:58:04,652 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 12 states. [2019-11-21 12:58:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:06,056 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2019-11-21 12:58:06,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 12:58:06,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-21 12:58:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:06,058 INFO L225 Difference]: With dead ends: 145 [2019-11-21 12:58:06,058 INFO L226 Difference]: Without dead ends: 145 [2019-11-21 12:58:06,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-11-21 12:58:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-21 12:58:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2019-11-21 12:58:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-21 12:58:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2019-11-21 12:58:06,065 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 26 [2019-11-21 12:58:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:06,066 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2019-11-21 12:58:06,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 12:58:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2019-11-21 12:58:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 12:58:06,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:06,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:06,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:06,270 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:58:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1455614590, now seen corresponding path program 1 times [2019-11-21 12:58:06,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:06,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [296454696] [2019-11-21 12:58:06,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:06,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-21 12:58:06,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:06,624 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_17|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_33|]} [2019-11-21 12:58:06,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 12:58:06,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:06,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:06,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:06,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:06,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:06,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:06,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:06,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:06,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2019-11-21 12:58:06,708 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-21 12:58:06,713 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:58:06,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:06,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:06,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:06,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:06,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-21 12:58:06,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:06,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:06,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:06,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:10 [2019-11-21 12:58:06,791 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:58:06,791 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:06,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:06,962 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:58:06,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [296454696] [2019-11-21 12:58:06,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:06,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-21 12:58:06,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635924225] [2019-11-21 12:58:06,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 12:58:06,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 12:58:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-21 12:58:06,964 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand 11 states. [2019-11-21 12:58:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:07,671 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-11-21 12:58:07,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:58:07,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-11-21 12:58:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:07,673 INFO L225 Difference]: With dead ends: 123 [2019-11-21 12:58:07,673 INFO L226 Difference]: Without dead ends: 123 [2019-11-21 12:58:07,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:58:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-21 12:58:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-11-21 12:58:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-21 12:58:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-11-21 12:58:07,681 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 26 [2019-11-21 12:58:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:07,681 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-11-21 12:58:07,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 12:58:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-11-21 12:58:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 12:58:07,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:07,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:07,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:07,884 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:58:07,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:07,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1439813039, now seen corresponding path program 1 times [2019-11-21 12:58:07,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:07,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1883208211] [2019-11-21 12:58:07,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:08,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-21 12:58:08,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:08,222 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:58:08,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:58:08,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,272 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-11-21 12:58:08,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:08,273 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:58:08,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:39 [2019-11-21 12:58:08,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:08,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:58:08,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:08,370 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-21 12:58:08,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:08,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:08,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2019-11-21 12:58:08,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:58:08,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:08,452 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-21 12:58:08,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:08,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:08,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2019-11-21 12:58:08,530 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-21 12:58:08,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:08,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:08,533 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:58:08,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:7 [2019-11-21 12:58:08,564 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:58:08,564 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:08,820 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:58:08,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1883208211] [2019-11-21 12:58:08,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:08,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 6] imperfect sequences [] total 12 [2019-11-21 12:58:08,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756961064] [2019-11-21 12:58:08,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 12:58:08,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:08,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 12:58:08,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-21 12:58:08,822 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 13 states. [2019-11-21 12:58:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:10,276 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-11-21 12:58:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 12:58:10,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-21 12:58:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:10,279 INFO L225 Difference]: With dead ends: 145 [2019-11-21 12:58:10,279 INFO L226 Difference]: Without dead ends: 145 [2019-11-21 12:58:10,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2019-11-21 12:58:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-21 12:58:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2019-11-21 12:58:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-21 12:58:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-11-21 12:58:10,285 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 28 [2019-11-21 12:58:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:10,285 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-11-21 12:58:10,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 12:58:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-11-21 12:58:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 12:58:10,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:10,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:10,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:10,490 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:58:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1439813038, now seen corresponding path program 1 times [2019-11-21 12:58:10,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:10,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [532070724] [2019-11-21 12:58:10,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:10,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-21 12:58:10,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:10,804 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:58:10,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 12:58:10,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:10,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:10,821 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:58:10,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:30 [2019-11-21 12:58:10,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:58:10,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:10,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:10,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:10,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:10,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:10,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:10,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:10,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:10,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2019-11-21 12:58:10,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:10,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:10,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:10,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:10,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:10,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-11-21 12:58:11,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:11,019 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:11,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:11,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:11,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:11,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-11-21 12:58:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:58:11,103 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:11,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:11,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:11,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:11,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:11,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-11-21 12:58:11,918 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:11,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:12,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-11-21 12:58:12,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:12,069 INFO L567 ElimStorePlain]: treesize reduction 41, result has 45.3 percent of original size [2019-11-21 12:58:12,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:12,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:34 [2019-11-21 12:58:12,234 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:58:12,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [532070724] [2019-11-21 12:58:12,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:12,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 21 [2019-11-21 12:58:12,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731804576] [2019-11-21 12:58:12,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 12:58:12,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:12,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 12:58:12,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-21 12:58:12,235 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 22 states. [2019-11-21 12:58:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:14,452 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-21 12:58:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 12:58:14,453 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-11-21 12:58:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:14,454 INFO L225 Difference]: With dead ends: 128 [2019-11-21 12:58:14,454 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 12:58:14,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2019-11-21 12:58:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 12:58:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-21 12:58:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 12:58:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-11-21 12:58:14,459 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 28 [2019-11-21 12:58:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:14,459 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-11-21 12:58:14,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 12:58:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-11-21 12:58:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 12:58:14,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:14,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:14,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:14,667 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:58:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash -540919935, now seen corresponding path program 1 times [2019-11-21 12:58:14,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:14,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1540802515] [2019-11-21 12:58:14,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:15,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-21 12:58:15,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:15,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:58:15,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:15,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:15,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:58:15,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:15,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:15,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:15,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-21 12:58:15,068 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:58:15,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:15,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:15,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:15,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:58:15,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:58:15,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:15,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:15,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:15,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-11-21 12:58:15,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-21 12:58:15,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:15,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:15,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:15,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2019-11-21 12:58:15,433 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:58:15,434 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:16,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2019-11-21 12:58:16,237 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:16,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2019-11-21 12:58:16,248 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:16,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:16,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-21 12:58:16,334 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:94 [2019-11-21 12:58:16,483 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-11-21 12:58:16,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:16,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:16,488 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-21 12:58:16,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-11-21 12:58:16,595 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:16,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:16,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:16,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:42 [2019-11-21 12:58:17,094 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-21 12:58:17,245 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:58:17,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1540802515] [2019-11-21 12:58:17,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:17,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 24 [2019-11-21 12:58:17,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739460804] [2019-11-21 12:58:17,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-21 12:58:17,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-21 12:58:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-21 12:58:17,247 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 25 states. [2019-11-21 12:58:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:19,698 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-11-21 12:58:19,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 12:58:19,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-11-21 12:58:19,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:19,700 INFO L225 Difference]: With dead ends: 119 [2019-11-21 12:58:19,700 INFO L226 Difference]: Without dead ends: 119 [2019-11-21 12:58:19,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2019-11-21 12:58:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-21 12:58:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-11-21 12:58:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 12:58:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-21 12:58:19,706 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 35 [2019-11-21 12:58:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:19,707 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-21 12:58:19,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-21 12:58:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-21 12:58:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 12:58:19,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:19,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:19,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:19,912 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:58:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:19,916 INFO L82 PathProgramCache]: Analyzing trace with hash -540919934, now seen corresponding path program 1 times [2019-11-21 12:58:19,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:19,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1697311475] [2019-11-21 12:58:19,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:20,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-21 12:58:20,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:20,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:58:20,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:20,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:58:20,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:20,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,307 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-21 12:58:20,324 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:58:20,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:20,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-21 12:58:20,500 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:58:20,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:20,520 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:58:20,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:20,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:20,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-11-21 12:58:20,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-21 12:58:20,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:20,693 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:58:20,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:20,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:20,700 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:58:20,700 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-21 12:58:20,748 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:58:20,748 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:21,599 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 12:58:22,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-11-21 12:58:22,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:22,836 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 12:58:22,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:22,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:22,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:22,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:23,020 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 12:58:23,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:23,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:23,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:23,028 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:23,154 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 12:58:23,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:23,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:23,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:23,162 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:23,284 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:58:23,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:23,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 12:58:23,286 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-21 12:58:23,570 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:58:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:24,144 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-21 12:58:24,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2019-11-21 12:58:24,174 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:24,465 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-21 12:58:24,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:24,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-11-21 12:58:24,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:24,875 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-11-21 12:58:24,876 INFO L567 ElimStorePlain]: treesize reduction 36, result has 79.5 percent of original size [2019-11-21 12:58:24,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:24,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:24,887 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:25,080 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:58:25,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:25,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:25,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:25,098 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:25,220 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:58:25,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:25,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 12:58:25,221 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-21 12:58:25,517 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:58:26,065 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:58:26,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1697311475] [2019-11-21 12:58:26,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:26,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 26 [2019-11-21 12:58:26,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68773109] [2019-11-21 12:58:26,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-21 12:58:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-21 12:58:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-21 12:58:26,067 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 27 states. [2019-11-21 12:58:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:31,095 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-11-21 12:58:31,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 12:58:31,096 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-11-21 12:58:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:31,097 INFO L225 Difference]: With dead ends: 105 [2019-11-21 12:58:31,097 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 12:58:31,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2019-11-21 12:58:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 12:58:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2019-11-21 12:58:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 12:58:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-11-21 12:58:31,101 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 35 [2019-11-21 12:58:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:31,101 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-11-21 12:58:31,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-21 12:58:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-11-21 12:58:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 12:58:31,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:31,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:31,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:31,303 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:58:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:31,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1917126943, now seen corresponding path program 1 times [2019-11-21 12:58:31,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:31,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [701536122] [2019-11-21 12:58:31,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:31,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-21 12:58:31,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:31,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:58:31,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:31,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:31,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:58:31,737 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:31,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:31,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:31,744 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-21 12:58:31,764 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:58:31,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:31,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:31,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:31,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-21 12:58:32,013 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:58:32,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:32,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:32,037 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:58:32,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:32,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:32,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:32,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-11-21 12:58:32,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-21 12:58:32,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:32,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:32,237 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:58:32,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:32,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:32,242 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:58:32,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-21 12:58:32,371 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:58:32,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:33,652 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 12:58:34,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:34,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2019-11-21 12:58:34,802 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:34,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2019-11-21 12:58:34,826 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:35,590 WARN L192 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-11-21 12:58:35,591 INFO L567 ElimStorePlain]: treesize reduction 32, result has 92.6 percent of original size [2019-11-21 12:58:35,617 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 150 treesize of output 138 [2019-11-21 12:58:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,632 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:35,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2019-11-21 12:58:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:35,689 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:35,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2019-11-21 12:58:35,724 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:35,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2019-11-21 12:58:35,768 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:35,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:35,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:35,786 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:35,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:35,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:35,802 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:36,732 WARN L192 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 49 [2019-11-21 12:58:36,733 INFO L567 ElimStorePlain]: treesize reduction 176, result has 54.9 percent of original size [2019-11-21 12:58:36,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-21 12:58:36,734 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:384, output treesize:214 [2019-11-21 12:58:37,400 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-21 12:58:37,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:37,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:37,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:37,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:37,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:58:37,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:58:37,485 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 12:58:38,434 WARN L192 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-11-21 12:58:38,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2019-11-21 12:58:38,529 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:39,172 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-21 12:58:39,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:39,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2019-11-21 12:58:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:39,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:39,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:39,232 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:40,010 WARN L192 SmtUtils]: Spent 778.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-21 12:58:40,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:40,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 119 [2019-11-21 12:58:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:40,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:40,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:40,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:40,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:40,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:40,058 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:41,458 WARN L192 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-11-21 12:58:41,459 INFO L567 ElimStorePlain]: treesize reduction 50, result has 88.5 percent of original size [2019-11-21 12:58:41,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2019-11-21 12:58:41,506 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:42,529 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-11-21 12:58:42,530 INFO L567 ElimStorePlain]: treesize reduction 46, result has 87.5 percent of original size [2019-11-21 12:58:42,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2019-11-21 12:58:42,569 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:43,210 WARN L192 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-11-21 12:58:43,211 INFO L567 ElimStorePlain]: treesize reduction 36, result has 88.2 percent of original size [2019-11-21 12:58:43,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:43,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:43,224 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:43,516 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-21 12:58:43,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:43,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:43,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:43,530 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:43,786 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 12:58:43,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:43,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:43,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:43,800 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:44,020 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 12:58:44,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:44,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-21 12:58:44,021 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:352, output treesize:198 [2019-11-21 12:58:44,470 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 12:58:45,058 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:58:45,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701536122] [2019-11-21 12:58:45,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:45,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 15] imperfect sequences [] total 31 [2019-11-21 12:58:45,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498862766] [2019-11-21 12:58:45,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-21 12:58:45,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-21 12:58:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-11-21 12:58:45,060 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 32 states. [2019-11-21 12:58:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:51,143 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-11-21 12:58:51,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-21 12:58:51,144 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-21 12:58:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:51,145 INFO L225 Difference]: With dead ends: 103 [2019-11-21 12:58:51,145 INFO L226 Difference]: Without dead ends: 103 [2019-11-21 12:58:51,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2019-11-21 12:58:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-21 12:58:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-21 12:58:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 12:58:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-11-21 12:58:51,149 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 40 [2019-11-21 12:58:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:51,150 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-11-21 12:58:51,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-21 12:58:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-11-21 12:58:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-21 12:58:51,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:51,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:51,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:51,355 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:58:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:51,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1221359288, now seen corresponding path program 1 times [2019-11-21 12:58:51,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:51,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1390000391] [2019-11-21 12:58:51,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:51,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-21 12:58:51,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:51,903 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:58:51,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:58:51,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:51,963 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.6 percent of original size [2019-11-21 12:58:51,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:51,965 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:58:51,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:51 [2019-11-21 12:58:51,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:52,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:58:52,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2019-11-21 12:58:52,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:58:52,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:52,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:58:52,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2019-11-21 12:58:52,338 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:58:52,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:52,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-21 12:58:52,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:52,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 12:58:52,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:52,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-21 12:58:52,555 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_275|], 6=[|v_#memory_$Pointer$.base_315|]} [2019-11-21 12:58:52,561 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:58:52,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:52,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 84 [2019-11-21 12:58:52,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:52,754 INFO L567 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-11-21 12:58:52,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:52,755 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2019-11-21 12:58:53,134 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-21 12:58:53,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:53,274 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:53,275 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 15 treesize of output 19 [2019-11-21 12:58:53,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:53,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:53,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:53,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-11-21 12:58:53,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:53,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:53,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:53,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:58 [2019-11-21 12:58:53,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2019-11-21 12:58:53,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:53,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:53,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:53,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2019-11-21 12:58:53,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:53,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 17 [2019-11-21 12:58:53,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:53,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:53,700 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:58:53,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:5 [2019-11-21 12:58:53,832 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:58:53,832 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:54,419 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-21 12:58:54,520 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-21 12:58:54,674 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:58:54,833 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:58:55,092 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 12:58:55,196 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 12:58:55,414 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 12:58:55,612 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:58:55,887 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-21 12:58:56,113 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-21 12:58:56,214 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 12:58:56,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:56,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2019-11-21 12:58:56,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:56,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:56,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:56,259 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:56,327 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-21 12:58:56,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:56,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:58:56,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2019-11-21 12:58:56,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:56,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:57,153 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-21 12:58:57,257 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-21 12:58:57,426 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:58:57,587 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:58:57,849 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 12:58:57,956 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 12:58:58,135 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 12:58:58,300 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:58:58,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:58,507 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:384) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 12:58:58,515 INFO L168 Benchmark]: Toolchain (without parser) took 312656.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-11-21 12:58:58,516 INFO L168 Benchmark]: CDTParser took 0.31 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:58:58,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 947.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-21 12:58:58,517 INFO L168 Benchmark]: Boogie Preprocessor took 109.79 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-21 12:58:58,517 INFO L168 Benchmark]: RCFGBuilder took 1628.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2019-11-21 12:58:58,517 INFO L168 Benchmark]: TraceAbstraction took 309966.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 983.0 MB in the beginning and 1.1 GB in the end (delta: -94.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:58:58,519 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.31 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 947.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.79 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1628.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 309966.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 983.0 MB in the beginning and 1.1 GB in the end (delta: -94.7 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...