./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 64bit -------------------------------------------------------------------------------- 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_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 91478db75b245dd627777f414c41af02c9caac2f --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 11:56:53,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 11:56:53,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 11:56:53,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 11:56:53,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 11:56:53,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 11:56:53,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 11:56:53,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 11:56:53,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 11:56:53,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 11:56:53,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 11:56:53,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 11:56:53,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 11:56:53,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 11:56:53,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 11:56:53,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 11:56:53,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 11:56:53,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 11:56:53,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 11:56:53,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 11:56:53,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 11:56:53,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 11:56:53,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 11:56:53,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 11:56:53,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 11:56:53,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 11:56:53,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 11:56:53,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 11:56:53,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 11:56:53,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 11:56:53,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 11:56:53,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 11:56:53,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 11:56:53,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 11:56:53,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 11:56:53,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 11:56:53,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 11:56:53,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 11:56:53,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 11:56:53,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 11:56:53,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 11:56:53,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 11:56:53,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 11:56:53,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 11:56:53,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 11:56:53,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 11:56:53,451 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 11:56:53,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 11:56:53,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 11:56:53,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 11:56:53,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 11:56:53,452 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 11:56:53,453 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 11:56:53,453 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 11:56:53,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 11:56:53,453 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 11:56:53,454 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:53,454 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 11:56:53,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 11:56:53,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 11:56:53,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 11:56:53,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 11:56:53,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:56:53,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 11:56:53,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 11:56:53,456 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 11:56:53,457 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 11:56:53,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 11:56:53,457 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91478db75b245dd627777f414c41af02c9caac2f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 11:56:53,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 11:56:53,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 11:56:53,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 11:56:53,777 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 11:56:53,778 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 11:56:53,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2019-11-21 11:56:53,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bb37df8/a4bdeae55e6547949a5652423f5571ef/FLAG124e1ab4b [2019-11-21 11:56:54,345 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 11:56:54,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2019-11-21 11:56:54,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bb37df8/a4bdeae55e6547949a5652423f5571ef/FLAG124e1ab4b [2019-11-21 11:56:54,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bb37df8/a4bdeae55e6547949a5652423f5571ef [2019-11-21 11:56:54,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 11:56:54,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 11:56:54,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 11:56:54,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 11:56:54,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 11:56:54,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:56:54" (1/1) ... [2019-11-21 11:56:54,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e5070b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:54, skipping insertion in model container [2019-11-21 11:56:54,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:56:54" (1/1) ... [2019-11-21 11:56:54,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 11:56:54,719 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:56:55,186 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 11:56:55,186 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 11:56:55,187 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,209 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 11:56:55,210 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 11:56:55,210 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,215 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 11:56:55,216 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 11:56:55,216 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,220 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 11:56:55,221 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 11:56:55,221 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,261 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 11:56:55,261 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 11:56:55,262 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,282 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 11:56:55,282 INFO L969 CHandler]: at location: C: (struct A13 *)ldv_malloc(sizeof(struct A13)) [764] [2019-11-21 11:56:55,283 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,300 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 11:56:55,301 INFO L969 CHandler]: at location: C: (typeof(*p) *)( (char *)__mptr - ((size_t) &((typeof(*p) *)0)->list) ) [772] [2019-11-21 11:56:55,301 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,303 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 11:56:55,306 INFO L969 CHandler]: at location: C: (typeof(*(p)) *)( (char *)__mptr - ((size_t) &((typeof(*(p)) *)0)->list) ) [772] [2019-11-21 11:56:55,306 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,309 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 11:56:55,310 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [772] [2019-11-21 11:56:55,310 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:56:55,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:56:55,344 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 11:56:55,371 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:56:55,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:56:55,473 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 11:56:55,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:56:55,626 INFO L205 MainTranslator]: Completed translation [2019-11-21 11:56:55,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55 WrapperNode [2019-11-21 11:56:55,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 11:56:55,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 11:56:55,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 11:56:55,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 11:56:55,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (1/1) ... [2019-11-21 11:56:55,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (1/1) ... [2019-11-21 11:56:55,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (1/1) ... [2019-11-21 11:56:55,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (1/1) ... [2019-11-21 11:56:55,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (1/1) ... [2019-11-21 11:56:55,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (1/1) ... [2019-11-21 11:56:55,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (1/1) ... [2019-11-21 11:56:55,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 11:56:55,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 11:56:55,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 11:56:55,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 11:56:55,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (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 11:56:55,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 11:56:55,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 11:56:55,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 11:56:55,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 11:56:55,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 11:56:55,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 11:56:55,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 11:56:55,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 11:56:55,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 11:56:55,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 11:56:55,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 11:56:55,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 11:56:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 11:56:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 11:56:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 11:56:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 11:56:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 11:56:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 11:56:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 11:56:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 11:56:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 11:56:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 11:56:55,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 11:56:55,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 11:56:55,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 11:56:55,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 11:56:55,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 11:56:55,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 11:56:55,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 11:56:55,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 11:56:55,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 11:56:55,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 11:56:55,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 11:56:55,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 11:56:55,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 11:56:55,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 11:56:55,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 11:56:55,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 11:56:55,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 11:56:55,817 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 11:56:55,817 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 11:56:55,818 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-11-21 11:56:55,818 INFO L138 BoogieDeclarations]: Found implementation of procedure free_unsafe_13 [2019-11-21 11:56:55,818 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 11:56:55,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 11:56:55,819 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 11:56:55,819 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 11:56:55,819 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 11:56:55,819 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 11:56:55,819 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 11:56:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 11:56:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 11:56:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 11:56:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 11:56:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 11:56:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 11:56:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 11:56:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 11:56:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 11:56:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 11:56:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 11:56:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 11:56:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 11:56:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 11:56:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 11:56:55,823 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 11:56:55,823 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 11:56:55,823 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 11:56:55,823 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 11:56:55,823 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 11:56:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 11:56:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 11:56:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 11:56:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 11:56:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 11:56:55,825 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 11:56:55,825 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 11:56:55,825 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 11:56:55,825 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 11:56:55,825 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 11:56:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 11:56:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 11:56:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 11:56:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 11:56:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 11:56:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 11:56:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 11:56:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 11:56:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 11:56:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 11:56:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 11:56:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 11:56:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 11:56:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 11:56:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 11:56:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 11:56:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 11:56:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 11:56:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 11:56:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 11:56:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 11:56:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 11:56:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 11:56:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 11:56:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 11:56:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 11:56:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 11:56:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 11:56:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 11:56:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 11:56:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 11:56:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 11:56:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 11:56:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 11:56:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 11:56:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 11:56:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 11:56:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 11:56:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 11:56:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 11:56:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 11:56:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 11:56:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 11:56:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 11:56:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 11:56:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 11:56:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 11:56:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 11:56:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 11:56:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 11:56:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 11:56:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 11:56:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 11:56:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 11:56:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 11:56:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 11:56:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 11:56:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 11:56:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 11:56:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 11:56:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 11:56:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 11:56:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 11:56:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 11:56:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 11:56:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 11:56:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 11:56:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 11:56:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 11:56:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 11:56:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 11:56:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 11:56:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 11:56:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 11:56:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 11:56:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 11:56:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 11:56:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 11:56:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 11:56:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 11:56:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 11:56:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 11:56:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 11:56:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 11:56:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 11:56:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 11:56:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 11:56:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 11:56:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 11:56:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 11:56:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 11:56:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 11:56:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 11:56:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 11:56:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 11:56:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 11:56:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 11:56:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 11:56:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 11:56:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 11:56:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 11:56:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 11:56:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 11:56:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 11:56:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 11:56:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 11:56:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 11:56:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 11:56:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 11:56:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 11:56:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 11:56:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 11:56:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 11:56:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 11:56:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 11:56:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 11:56:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 11:56:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 11:56:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 11:56:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 11:56:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 11:56:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 11:56:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 11:56:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-11-21 11:56:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure free_unsafe_13 [2019-11-21 11:56:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 11:56:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 11:56:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 11:56:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 11:56:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 11:56:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 11:56:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 11:56:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 11:56:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 11:56:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 11:56:56,539 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 11:56:57,012 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 11:56:57,402 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 11:56:57,403 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-21 11:56:57,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:56:57 BoogieIcfgContainer [2019-11-21 11:56:57,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 11:56:57,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 11:56:57,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 11:56:57,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 11:56:57,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:56:54" (1/3) ... [2019-11-21 11:56:57,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c76dc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:56:57, skipping insertion in model container [2019-11-21 11:56:57,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:56:55" (2/3) ... [2019-11-21 11:56:57,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c76dc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:56:57, skipping insertion in model container [2019-11-21 11:56:57,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:56:57" (3/3) ... [2019-11-21 11:56:57,412 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test13_2.i [2019-11-21 11:56:57,422 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 11:56:57,431 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 77 error locations. [2019-11-21 11:56:57,443 INFO L249 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2019-11-21 11:56:57,464 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 11:56:57,464 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 11:56:57,464 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 11:56:57,465 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 11:56:57,465 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 11:56:57,465 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 11:56:57,465 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 11:56:57,465 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 11:56:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2019-11-21 11:56:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 11:56:57,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:56:57,498 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 11:56:57,499 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:56:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:56:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1991725056, now seen corresponding path program 1 times [2019-11-21 11:56:57,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:56:57,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1433143826] [2019-11-21 11:56:57,518 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 11:56:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:56:57,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 11:56:57,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:56:58,230 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:56:58,232 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 11:56:58,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:58,301 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 11:56:58,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:58,312 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 11:56:58,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:30 [2019-11-21 11:56:58,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:58,366 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 11:56:58,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:58,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:58,371 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 11:56:58,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:5 [2019-11-21 11:56:58,413 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 11:56:58,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:58,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:58,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:56:58,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 11:56:58,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:58,513 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 11:56:58,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:58,543 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 11:56:58,545 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 11:56:58,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-21 11:56:58,672 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 11:56:58,673 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:56:59,034 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 11:56:59,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1433143826] [2019-11-21 11:56:59,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:56:59,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-21 11:56:59,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096722472] [2019-11-21 11:56:59,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 11:56:59,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:56:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 11:56:59,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-21 11:56:59,062 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 14 states. [2019-11-21 11:57:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:57:07,388 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2019-11-21 11:57:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 11:57:07,390 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-21 11:57:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:57:07,403 INFO L225 Difference]: With dead ends: 157 [2019-11-21 11:57:07,404 INFO L226 Difference]: Without dead ends: 145 [2019-11-21 11:57:07,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-11-21 11:57:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-21 11:57:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2019-11-21 11:57:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 11:57:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-21 11:57:07,462 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 17 [2019-11-21 11:57:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:57:07,463 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-21 11:57:07,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 11:57:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-21 11:57:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 11:57:07,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:57:07,464 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 11:57:07,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:57:07,670 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:57:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:57:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1991725057, now seen corresponding path program 1 times [2019-11-21 11:57:07,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:57:07,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1711417863] [2019-11-21 11:57:07,673 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 11:57:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:57:08,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-21 11:57:08,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:57:08,064 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:57:08,065 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 11:57:08,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:57:08,142 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:57:08,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 11:57:08,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,201 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.1 percent of original size [2019-11-21 11:57:08,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:57:08,204 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 11:57:08,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:43 [2019-11-21 11:57:08,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:57:08,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:57:08,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:57:08,280 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 42 treesize of output 38 [2019-11-21 11:57:08,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,298 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 40 treesize of output 36 [2019-11-21 11:57:08,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,316 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 35 treesize of output 31 [2019-11-21 11:57:08,316 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,416 INFO L567 ElimStorePlain]: treesize reduction 33, result has 66.0 percent of original size [2019-11-21 11:57:08,417 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 11:57:08,418 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:118, output treesize:64 [2019-11-21 11:57:08,542 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_2, |v_#length_BEFORE_CALL_4|], 1=[v_prenex_1, |v_#valid_BEFORE_CALL_10|]} [2019-11-21 11:57:08,550 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 11:57:08,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:57:08,600 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 11:57:08,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:57:08,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:57:08,644 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 11:57:08,645 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,668 INFO L567 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-11-21 11:57:08,668 INFO L464 ElimStorePlain]: Eliminatee |v_#valid_BEFORE_CALL_10| vanished before elimination [2019-11-21 11:57:08,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:57:08,669 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:55, output treesize:10 [2019-11-21 11:57:10,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:57:10,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:57:10,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-21 11:57:10,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:10,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:57:10,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:57:10,847 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 11:57:10,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:10,951 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-21 11:57:10,952 INFO L567 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size [2019-11-21 11:57:10,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:57:10,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2019-11-21 11:57:10,990 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:11,025 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:57:11,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-11-21 11:57:11,027 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:57:11,069 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-21 11:57:11,070 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 11:57:11,071 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2019-11-21 11:57:11,149 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 11:57:11,150 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:57:11,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:57:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:57:13,718 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 11:57:14,288 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-21 11:57:15,038 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 11:57:15,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1711417863] [2019-11-21 11:57:15,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:57:15,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-21 11:57:15,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391882495] [2019-11-21 11:57:15,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 11:57:15,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:57:15,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 11:57:15,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=163, Unknown=2, NotChecked=0, Total=210 [2019-11-21 11:57:15,042 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 15 states. [2019-11-21 11:57:30,207 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-11-21 11:58:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:58:11,905 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-11-21 11:58:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 11:58:11,906 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-11-21 11:58:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:58:11,908 INFO L225 Difference]: With dead ends: 142 [2019-11-21 11:58:11,908 INFO L226 Difference]: Without dead ends: 142 [2019-11-21 11:58:11,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=159, Invalid=391, Unknown=2, NotChecked=0, Total=552 [2019-11-21 11:58:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-21 11:58:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2019-11-21 11:58:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-21 11:58:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-11-21 11:58:11,923 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 17 [2019-11-21 11:58:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:58:11,923 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-11-21 11:58:11,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 11:58:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-11-21 11:58:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:58:11,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:58:11,925 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 11:58:12,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:58:12,127 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:58:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:58:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash 508317535, now seen corresponding path program 1 times [2019-11-21 11:58:12,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:58:12,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [121966030] [2019-11-21 11:58:12,129 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 11:58:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:58:12,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 11:58:12,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:58:12,449 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 11:58:12,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:12,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:12,456 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 11:58:12,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-11-21 11:58:12,484 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 11:58:12,484 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:58:12,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:12,501 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 11:58:12,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:58:12,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:12,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:12,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:58:12,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-21 11:58:12,595 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 11:58:12,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [121966030] [2019-11-21 11:58:12,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:58:12,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-21 11:58:12,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952429237] [2019-11-21 11:58:12,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 11:58:12,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:58:12,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 11:58:12,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:58:12,597 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 11 states. [2019-11-21 11:58:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:58:13,373 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2019-11-21 11:58:13,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 11:58:13,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-21 11:58:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:58:13,377 INFO L225 Difference]: With dead ends: 141 [2019-11-21 11:58:13,377 INFO L226 Difference]: Without dead ends: 141 [2019-11-21 11:58:13,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-21 11:58:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-21 11:58:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2019-11-21 11:58:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-21 11:58:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-11-21 11:58:13,389 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 20 [2019-11-21 11:58:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:58:13,390 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-11-21 11:58:13,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 11:58:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-11-21 11:58:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:58:13,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:58:13,391 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 11:58:13,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:58:13,595 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:58:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:58:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash 508317536, now seen corresponding path program 1 times [2019-11-21 11:58:13,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:58:13,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1207397189] [2019-11-21 11:58:13,597 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 11:58:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:58:13,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-21 11:58:13,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:58:13,921 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:58:13,922 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 11:58:13,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:13,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:14,009 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:58:14,010 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 11:58:14,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:14,072 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.3 percent of original size [2019-11-21 11:58:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:14,074 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 11:58:14,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:50 [2019-11-21 11:58:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:14,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:14,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:14,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:14,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:14,246 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 55 treesize of output 73 [2019-11-21 11:58:14,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:14,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:14,261 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 48 treesize of output 52 [2019-11-21 11:58:14,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:14,267 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 11:58:14,268 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:14,388 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-11-21 11:58:14,388 INFO L567 ElimStorePlain]: treesize reduction 8, result has 89.9 percent of original size [2019-11-21 11:58:14,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:14,401 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 36 treesize of output 40 [2019-11-21 11:58:14,401 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:14,408 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 11:58:14,409 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:14,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:14,425 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 11:58:14,425 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:157, output treesize:24 [2019-11-21 11:58:16,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:16,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:16,586 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 60 treesize of output 100 [2019-11-21 11:58:16,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:16,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:16,633 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 58 treesize of output 76 [2019-11-21 11:58:16,633 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:16,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:16,667 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 51 treesize of output 69 [2019-11-21 11:58:16,669 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:16,877 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-11-21 11:58:16,878 INFO L567 ElimStorePlain]: treesize reduction 55, result has 61.3 percent of original size [2019-11-21 11:58:16,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:16,936 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 44 treesize of output 57 [2019-11-21 11:58:16,937 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:16,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:16,967 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 42 treesize of output 55 [2019-11-21 11:58:16,968 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:17,104 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-21 11:58:17,105 INFO L567 ElimStorePlain]: treesize reduction 20, result has 81.3 percent of original size [2019-11-21 11:58:17,106 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 11:58:17,106 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:170, output treesize:61 [2019-11-21 11:58:17,217 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 11:58:17,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:17,242 INFO L567 ElimStorePlain]: treesize reduction 5, result has 83.3 percent of original size [2019-11-21 11:58:17,254 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 11:58:17,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:58:17,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:58:17,264 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 11:58:17,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:9 [2019-11-21 11:58:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:58:17,387 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:58:18,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:18,439 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 11:58:18,927 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 11:58:18,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:58:18,956 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-21 11:58:21,393 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-21 11:58:21,413 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-21 11:58:26,224 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 11:58:26,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1207397189] [2019-11-21 11:58:26,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:58:26,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2019-11-21 11:58:26,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560495785] [2019-11-21 11:58:26,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 11:58:26,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:58:26,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 11:58:26,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=326, Unknown=1, NotChecked=0, Total=380 [2019-11-21 11:58:26,226 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 20 states. [2019-11-21 11:58:52,511 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 11:58:53,282 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-21 11:58:55,416 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 11:59:08,383 WARN L192 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-21 11:59:09,459 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 11:59:31,626 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 11:59:58,547 WARN L192 SmtUtils]: Spent 787.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-21 12:00:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:13,529 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-11-21 12:00:13,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 12:00:13,533 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-11-21 12:00:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:13,535 INFO L225 Difference]: With dead ends: 142 [2019-11-21 12:00:13,536 INFO L226 Difference]: Without dead ends: 142 [2019-11-21 12:00:13,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=251, Invalid=938, Unknown=1, NotChecked=0, Total=1190 [2019-11-21 12:00:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-21 12:00:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 96. [2019-11-21 12:00:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-21 12:00:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-11-21 12:00:13,549 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 20 [2019-11-21 12:00:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:13,549 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-11-21 12:00:13,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 12:00:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-11-21 12:00:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:00:13,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:13,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:00:13,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:13,752 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1422025552, now seen corresponding path program 1 times [2019-11-21 12:00:13,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:13,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1120736600] [2019-11-21 12:00:13,754 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:00:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:14,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 12:00:14,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:14,082 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:00:14,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:14,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:14,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:14,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:00:14,152 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:00:14,152 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:14,318 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:00:14,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1120736600] [2019-11-21 12:00:14,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:14,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 13 [2019-11-21 12:00:14,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992419170] [2019-11-21 12:00:14,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:00:14,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:14,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:00:14,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:00:14,320 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 14 states. [2019-11-21 12:00:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:15,056 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-11-21 12:00:15,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:00:15,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-21 12:00:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:15,060 INFO L225 Difference]: With dead ends: 112 [2019-11-21 12:00:15,060 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 12:00:15,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:00:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 12:00:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-11-21 12:00:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 12:00:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 12:00:15,070 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 21 [2019-11-21 12:00:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:15,070 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 12:00:15,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:00:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 12:00:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:00:15,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:15,071 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:00:15,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:15,275 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1422025551, now seen corresponding path program 1 times [2019-11-21 12:00:15,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:15,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [672299685] [2019-11-21 12:00:15,277 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:00:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:15,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 12:00:15,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:15,593 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:00:15,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:15,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:15,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:15,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:00:15,716 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:00:15,717 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:16,551 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:00:16,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [672299685] [2019-11-21 12:00:16,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:16,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-21 12:00:16,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997483041] [2019-11-21 12:00:16,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 12:00:16,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:16,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 12:00:16,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-21 12:00:16,553 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 18 states. [2019-11-21 12:00:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:18,494 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2019-11-21 12:00:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:00:18,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-21 12:00:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:18,497 INFO L225 Difference]: With dead ends: 110 [2019-11-21 12:00:18,497 INFO L226 Difference]: Without dead ends: 110 [2019-11-21 12:00:18,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-21 12:00:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-21 12:00:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-11-21 12:00:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 12:00:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2019-11-21 12:00:18,507 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 21 [2019-11-21 12:00:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:18,507 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2019-11-21 12:00:18,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 12:00:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2019-11-21 12:00:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:00:18,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:18,508 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:00:18,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:18,712 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1292942833, now seen corresponding path program 1 times [2019-11-21 12:00:18,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:18,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1949175932] [2019-11-21 12:00:18,714 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:00:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:19,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:00:19,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:19,038 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:00:19,038 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:19,084 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:00:19,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1949175932] [2019-11-21 12:00:19,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:19,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:00:19,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354156160] [2019-11-21 12:00:19,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:00:19,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:00:19,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:00:19,086 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 5 states. [2019-11-21 12:00:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:19,115 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-11-21 12:00:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:00:19,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-21 12:00:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:19,117 INFO L225 Difference]: With dead ends: 93 [2019-11-21 12:00:19,117 INFO L226 Difference]: Without dead ends: 93 [2019-11-21 12:00:19,118 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:00:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-21 12:00:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-21 12:00:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-21 12:00:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2019-11-21 12:00:19,124 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 21 [2019-11-21 12:00:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:19,125 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2019-11-21 12:00:19,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:00:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2019-11-21 12:00:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:00:19,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:19,127 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:00:19,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:19,328 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 438622591, now seen corresponding path program 1 times [2019-11-21 12:00:19,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:19,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [349017247] [2019-11-21 12:00:19,329 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:00:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:19,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:00:19,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:19,576 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:00:19,576 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:19,637 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:00:19,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [349017247] [2019-11-21 12:00:19,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:19,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:00:19,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575235005] [2019-11-21 12:00:19,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:00:19,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:00:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:00:19,639 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 5 states. [2019-11-21 12:00:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:19,652 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-11-21 12:00:19,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:00:19,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-21 12:00:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:19,654 INFO L225 Difference]: With dead ends: 91 [2019-11-21 12:00:19,654 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 12:00:19,654 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:00:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 12:00:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-21 12:00:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-21 12:00:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2019-11-21 12:00:19,659 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 21 [2019-11-21 12:00:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:19,660 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2019-11-21 12:00:19,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:00:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2019-11-21 12:00:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:00:19,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:19,661 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:00:19,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:19,864 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash 567705310, now seen corresponding path program 1 times [2019-11-21 12:00:19,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:19,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1740870783] [2019-11-21 12:00:19,867 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:00:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:20,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-21 12:00:20,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:20,182 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:00:20,182 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:00:20,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:20,223 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 12:00:20,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:20,225 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:00:20,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-21 12:00:20,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:20,288 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:00:20,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:20,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:20,304 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:00:20,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:20,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:20,313 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:00:20,313 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-21 12:00:20,342 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:00:20,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:20,354 INFO L567 ElimStorePlain]: treesize reduction 5, result has 64.3 percent of original size [2019-11-21 12:00:20,354 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:00:20,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2019-11-21 12:00:20,376 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:00:20,376 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:20,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:20,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:20,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:20,541 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 36 [2019-11-21 12:00:20,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:20,545 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 12:00:20,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:20,551 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 37 treesize of output 31 [2019-11-21 12:00:20,551 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:20,558 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 12:00:20,558 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:20,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:20,585 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_2| vanished before elimination [2019-11-21 12:00:20,585 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:00:20,585 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:60 [2019-11-21 12:00:20,726 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:00:20,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1740870783] [2019-11-21 12:00:20,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:20,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-21 12:00:20,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179779780] [2019-11-21 12:00:20,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:00:20,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:20,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:00:20,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:00:20,728 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 10 states. [2019-11-21 12:00:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:21,971 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2019-11-21 12:00:21,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:00:21,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-21 12:00:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:21,973 INFO L225 Difference]: With dead ends: 128 [2019-11-21 12:00:21,973 INFO L226 Difference]: Without dead ends: 126 [2019-11-21 12:00:21,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-11-21 12:00:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-21 12:00:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2019-11-21 12:00:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 12:00:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-11-21 12:00:21,980 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 21 [2019-11-21 12:00:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:21,980 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-11-21 12:00:21,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:00:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-11-21 12:00:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:00:21,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:21,981 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:00:22,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:22,191 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash 567705311, now seen corresponding path program 1 times [2019-11-21 12:00:22,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:22,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1267520928] [2019-11-21 12:00:22,194 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:00:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:22,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-21 12:00:22,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:22,476 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:00:22,476 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:00:22,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:22,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:22,493 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:00:22,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:28 [2019-11-21 12:00:22,539 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:00:22,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:22,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:22,565 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:00:22,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:22,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:22,584 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:00:22,585 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:22,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:22,596 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:00:22,596 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2019-11-21 12:00:22,634 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:00:22,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:22,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:22,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 12:00:22,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:22,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:22,661 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:00:22,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-11-21 12:00:22,695 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:00:22,695 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:23,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:00:23,079 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:00:23,079 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:00:23,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:23,146 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4| vanished before elimination [2019-11-21 12:00:23,157 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:00:23,158 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:00:23,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:23,239 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:00:23,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:54 [2019-11-21 12:00:23,417 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:00:23,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1267520928] [2019-11-21 12:00:23,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:23,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-21 12:00:23,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294121270] [2019-11-21 12:00:23,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 12:00:23,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:23,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 12:00:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:00:23,419 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 12 states. [2019-11-21 12:00:25,174 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 12:00:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:26,739 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2019-11-21 12:00:26,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 12:00:26,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-21 12:00:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:26,742 INFO L225 Difference]: With dead ends: 164 [2019-11-21 12:00:26,742 INFO L226 Difference]: Without dead ends: 162 [2019-11-21 12:00:26,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-21 12:00:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-21 12:00:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 118. [2019-11-21 12:00:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-21 12:00:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2019-11-21 12:00:26,748 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 21 [2019-11-21 12:00:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:26,749 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2019-11-21 12:00:26,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 12:00:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2019-11-21 12:00:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 12:00:26,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:26,750 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:00:26,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:26,955 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:26,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash -766953741, now seen corresponding path program 1 times [2019-11-21 12:00:26,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:26,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1382440223] [2019-11-21 12:00:26,957 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:00:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:27,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:00:27,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:27,302 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:00:27,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:27,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:27,304 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:00:27,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:7, output treesize:1 [2019-11-21 12:00:27,346 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:00:27,347 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:27,368 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:00:27,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1382440223] [2019-11-21 12:00:27,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:27,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 12:00:27,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986249286] [2019-11-21 12:00:27,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:00:27,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:00:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:00:27,371 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 6 states. [2019-11-21 12:00:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:29,922 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2019-11-21 12:00:29,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 12:00:29,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-21 12:00:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:29,924 INFO L225 Difference]: With dead ends: 141 [2019-11-21 12:00:29,924 INFO L226 Difference]: Without dead ends: 141 [2019-11-21 12:00:29,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:00:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-21 12:00:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2019-11-21 12:00:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-21 12:00:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2019-11-21 12:00:29,930 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 23 [2019-11-21 12:00:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:29,930 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2019-11-21 12:00:29,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:00:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2019-11-21 12:00:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 12:00:29,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:29,931 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:00:30,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:30,132 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash -766953740, now seen corresponding path program 1 times [2019-11-21 12:00:30,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:30,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [300016874] [2019-11-21 12:00:30,133 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:00:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:30,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-21 12:00:30,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:30,553 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 12:00:30,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:30,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:30,569 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 12:00:30,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:30,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:30,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:30,577 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-11-21 12:00:30,667 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:00:30,667 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:30,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:30,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:30,730 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:00:30,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:30,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:30,732 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:00:30,750 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:00:30,751 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:00:30,762 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:00:30,763 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:00:30,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:30,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:30,859 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:00:30,860 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:85 [2019-11-21 12:00:30,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:31,160 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-21 12:00:31,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:31,538 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-21 12:00:31,759 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-21 12:00:32,231 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 12:00:32,521 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 12:00:32,574 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:00:32,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [300016874] [2019-11-21 12:00:32,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:32,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-21 12:00:32,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223389856] [2019-11-21 12:00:32,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 12:00:32,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 12:00:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:00:32,576 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand 16 states. [2019-11-21 12:00:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:34,433 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2019-11-21 12:00:34,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:00:34,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-21 12:00:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:34,435 INFO L225 Difference]: With dead ends: 140 [2019-11-21 12:00:34,435 INFO L226 Difference]: Without dead ends: 140 [2019-11-21 12:00:34,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-11-21 12:00:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-21 12:00:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2019-11-21 12:00:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-21 12:00:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2019-11-21 12:00:34,441 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 23 [2019-11-21 12:00:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:34,441 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2019-11-21 12:00:34,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 12:00:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2019-11-21 12:00:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 12:00:34,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:34,443 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:00:34,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:34,644 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 410073591, now seen corresponding path program 1 times [2019-11-21 12:00:34,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:34,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [776324935] [2019-11-21 12:00:34,645 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:00:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:34,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-21 12:00:34,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:34,980 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:00:34,981 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:00:34,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:35,018 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 12:00:35,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:35,019 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:00:35,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-21 12:00:35,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:35,054 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:00:35,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:35,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:35,069 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:00:35,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:35,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:35,074 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:00:35,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-21 12:00:35,103 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:00:35,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:35,114 INFO L567 ElimStorePlain]: treesize reduction 5, result has 64.3 percent of original size [2019-11-21 12:00:35,114 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:00:35,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2019-11-21 12:00:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:00:35,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:35,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-11-21 12:00:35,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:35,333 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 12:00:35,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:35,341 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 36 [2019-11-21 12:00:35,341 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:35,344 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 12:00:35,345 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:35,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:35,380 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_6| vanished before elimination [2019-11-21 12:00:35,380 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:00:35,380 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:60 [2019-11-21 12:00:35,530 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:00:35,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [776324935] [2019-11-21 12:00:35,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:35,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-21 12:00:35,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340385238] [2019-11-21 12:00:35,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 12:00:35,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 12:00:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:00:35,535 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 12 states. [2019-11-21 12:00:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:36,977 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2019-11-21 12:00:36,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 12:00:36,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-21 12:00:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:36,979 INFO L225 Difference]: With dead ends: 155 [2019-11-21 12:00:36,979 INFO L226 Difference]: Without dead ends: 155 [2019-11-21 12:00:36,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-11-21 12:00:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-21 12:00:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 133. [2019-11-21 12:00:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-21 12:00:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-11-21 12:00:36,986 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 26 [2019-11-21 12:00:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:36,986 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-11-21 12:00:36,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 12:00:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-11-21 12:00:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 12:00:36,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:36,988 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:00:37,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:37,191 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash 410073592, now seen corresponding path program 1 times [2019-11-21 12:00:37,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:37,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1040148590] [2019-11-21 12:00:37,192 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:00:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:37,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 12:00:37,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:37,527 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:00:37,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:37,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:37,543 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:00:37,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:37,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:37,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:37,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-11-21 12:00:37,577 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:00:37,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:37,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:37,593 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:00:37,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:37,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:37,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:37,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-11-21 12:00:37,646 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:00:37,646 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:37,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:37,854 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:00:37,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1040148590] [2019-11-21 12:00:37,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:37,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-21 12:00:37,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834690843] [2019-11-21 12:00:37,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 12:00:37,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 12:00:37,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-21 12:00:37,856 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 11 states. [2019-11-21 12:00:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:38,456 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-11-21 12:00:38,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:00:38,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-11-21 12:00:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:38,458 INFO L225 Difference]: With dead ends: 114 [2019-11-21 12:00:38,458 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 12:00:38,458 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:00:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 12:00:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-11-21 12:00:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 12:00:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 12:00:38,463 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 26 [2019-11-21 12:00:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:38,463 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 12:00:38,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 12:00:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 12:00:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 12:00:38,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:38,464 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:00:38,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:38,672 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1329326739, now seen corresponding path program 1 times [2019-11-21 12:00:38,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:38,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1056238636] [2019-11-21 12:00:38,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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:00:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:38,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 12:00:38,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:39,028 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:00:39,028 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:00:39,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:39,065 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 12:00:39,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:39,066 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:00:39,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-21 12:00:39,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:39,100 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:00:39,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:39,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:39,116 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:00:39,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:39,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:39,121 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:00:39,121 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-21 12:00:39,142 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:00:39,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:39,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:39,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:39,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2019-11-21 12:00:39,251 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:00:39,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:39,255 INFO L567 ElimStorePlain]: treesize reduction 8, result has 38.5 percent of original size [2019-11-21 12:00:39,256 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:00:39,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2019-11-21 12:00:39,291 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:00:39,291 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:39,496 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:00:39,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1056238636] [2019-11-21 12:00:39,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:39,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 6] imperfect sequences [] total 13 [2019-11-21 12:00:39,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487866426] [2019-11-21 12:00:39,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:00:39,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:39,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:00:39,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:00:39,498 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 14 states. [2019-11-21 12:00:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:40,954 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-11-21 12:00:40,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 12:00:40,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-11-21 12:00:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:40,956 INFO L225 Difference]: With dead ends: 120 [2019-11-21 12:00:40,956 INFO L226 Difference]: Without dead ends: 120 [2019-11-21 12:00:40,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2019-11-21 12:00:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-21 12:00:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2019-11-21 12:00:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 12:00:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-11-21 12:00:40,961 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 28 [2019-11-21 12:00:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:40,961 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-11-21 12:00:40,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:00:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-11-21 12:00:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 12:00:40,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:40,962 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:00:41,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:41,165 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:41,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1329326738, now seen corresponding path program 1 times [2019-11-21 12:00:41,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:41,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [437731697] [2019-11-21 12:00:41,167 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:00:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:41,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 12:00:41,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:41,481 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:00:41,482 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:00:41,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:41,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:41,494 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:00:41,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:21 [2019-11-21 12:00:41,531 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:00:41,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:41,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:41,548 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:00:41,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:41,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:41,558 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:00:41,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2019-11-21 12:00:41,598 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:00:41,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:41,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:41,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:41,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-11-21 12:00:41,698 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:00:41,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:41,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:41,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:41,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2019-11-21 12:00:41,761 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:00:41,761 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:42,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:42,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:42,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:42,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:42,628 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:00:42,629 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:00:42,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:42,717 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:00:42,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:42,783 INFO L567 ElimStorePlain]: treesize reduction 41, result has 45.3 percent of original size [2019-11-21 12:00:42,783 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:00:42,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:34 [2019-11-21 12:00:42,978 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:00:42,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [437731697] [2019-11-21 12:00:42,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:42,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 21 [2019-11-21 12:00:42,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992474354] [2019-11-21 12:00:42,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 12:00:42,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 12:00:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-11-21 12:00:42,980 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 22 states. [2019-11-21 12:00:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:45,242 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-11-21 12:00:45,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 12:00:45,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-11-21 12:00:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:45,244 INFO L225 Difference]: With dead ends: 105 [2019-11-21 12:00:45,244 INFO L226 Difference]: Without dead ends: 86 [2019-11-21 12:00:45,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=260, Invalid=610, Unknown=0, NotChecked=0, Total=870 [2019-11-21 12:00:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-21 12:00:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-21 12:00:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-21 12:00:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-11-21 12:00:45,249 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 28 [2019-11-21 12:00:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:45,250 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2019-11-21 12:00:45,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 12:00:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2019-11-21 12:00:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 12:00:45,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:45,251 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:00:45,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:45,456 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1414276707, now seen corresponding path program 1 times [2019-11-21 12:00:45,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:45,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [18215975] [2019-11-21 12:00:45,457 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:00:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:45,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 12:00:45,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:45,822 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:00:45,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:45,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:45,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:45,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-21 12:00:45,833 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:00:45,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:45,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:45,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:45,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:00:46,053 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:00:46,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:46,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:46,063 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:00:46,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-11-21 12:00:46,188 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:00:46,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:46,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:46,196 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:00:46,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-11-21 12:00:46,242 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:00:46,243 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:46,956 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:00:46,957 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:00:46,968 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:00:46,969 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:00:47,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:47,044 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:00:47,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:94 [2019-11-21 12:00:47,200 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-11-21 12:00:47,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:00:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:00:47,204 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-21 12:00:47,321 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:00:47,321 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:00:47,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:47,364 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:00:47,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:42 [2019-11-21 12:00:47,882 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-21 12:00:48,024 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:00:48,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [18215975] [2019-11-21 12:00:48,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:48,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 24 [2019-11-21 12:00:48,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855926485] [2019-11-21 12:00:48,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-21 12:00:48,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-21 12:00:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-21 12:00:48,026 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 25 states. [2019-11-21 12:00:48,651 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-11-21 12:00:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:00:50,563 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-11-21 12:00:50,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 12:00:50,564 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-11-21 12:00:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:00:50,565 INFO L225 Difference]: With dead ends: 105 [2019-11-21 12:00:50,565 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 12:00:50,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2019-11-21 12:00:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 12:00:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2019-11-21 12:00:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-21 12:00:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-11-21 12:00:50,570 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 35 [2019-11-21 12:00:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:00:50,570 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-11-21 12:00:50,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-21 12:00:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-11-21 12:00:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 12:00:50,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:00:50,571 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:00:50,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:00:50,775 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:00:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:00:50,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1414276706, now seen corresponding path program 1 times [2019-11-21 12:00:50,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:00:50,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1208549516] [2019-11-21 12:00:50,777 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:00:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:00:51,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-21 12:00:51,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:00:51,146 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:00:51,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:51,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:51,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:51,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-21 12:00:51,167 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:00:51,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:51,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:51,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:00:51,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-21 12:00:51,347 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:00:51,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:51,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:51,369 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:00:51,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:51,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:51,385 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:00:51,385 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-11-21 12:00:51,535 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:00:51,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:51,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:51,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 12:00:51,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:51,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:51,557 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:00:51,557 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:11 [2019-11-21 12:00:51,613 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:00:51,614 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:00:52,604 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 12:00:53,739 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 62 treesize of output 54 [2019-11-21 12:00:53,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:53,987 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 12:00:53,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:53,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:53,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:53,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:54,176 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:00:54,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:54,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:54,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:54,188 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:54,342 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 12:00:54,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:54,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:54,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:54,352 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:54,510 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:00:54,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:54,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 12:00:54,511 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-21 12:00:54,840 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:00:54,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:00:54,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:00:54,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:00:55,415 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-21 12:00:55,448 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:00:55,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:55,679 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 12:00:55,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:55,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:55,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:55,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:55,889 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 12:00:55,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:55,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:55,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:55,899 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:56,059 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:00:56,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:56,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:56,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:00:56,071 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:00:56,212 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:00:56,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:00:56,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 12:00:56,213 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-21 12:00:56,533 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:00:57,010 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:00:57,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1208549516] [2019-11-21 12:00:57,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:00:57,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 26 [2019-11-21 12:00:57,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533884368] [2019-11-21 12:00:57,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-21 12:00:57,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:00:57,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-21 12:00:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-21 12:00:57,013 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 27 states. [2019-11-21 12:01:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:01:02,771 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-11-21 12:01:02,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 12:01:02,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-11-21 12:01:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:01:02,773 INFO L225 Difference]: With dead ends: 91 [2019-11-21 12:01:02,773 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 12:01:02,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2019-11-21 12:01:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 12:01:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2019-11-21 12:01:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-21 12:01:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-11-21 12:01:02,777 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 35 [2019-11-21 12:01:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:01:02,778 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-11-21 12:01:02,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-21 12:01:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-11-21 12:01:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 12:01:02,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:01:02,779 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:01:02,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:01:02,980 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:01:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:01:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 180993689, now seen corresponding path program 1 times [2019-11-21 12:01:02,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:01:02,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1155029922] [2019-11-21 12:01:02,982 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:01:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:01:03,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-21 12:01:03,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:01:03,406 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:01:03,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:03,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:03,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:01:03,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-21 12:01:03,424 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:01:03,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:03,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:03,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:01:03,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-21 12:01:03,603 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:01:03,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:03,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:03,625 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:01:03,625 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:03,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:03,639 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:01:03,640 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2019-11-21 12:01:03,798 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:01:03,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:03,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:03,810 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:01:03,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:03,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:03,818 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:01:03,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:11 [2019-11-21 12:01:03,947 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:01:03,948 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:01:05,308 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 12:01:05,719 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-21 12:01:06,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:06,669 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:01:06,670 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:01:06,696 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:01:06,697 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:01:07,554 WARN L192 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-11-21 12:01:07,554 INFO L567 ElimStorePlain]: treesize reduction 32, result has 92.6 percent of original size [2019-11-21 12:01:07,583 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:01:07,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:07,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:07,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,599 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:01:07,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-11-21 12:01:07,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,641 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:07,676 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:01:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:07,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:07,695 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:01:07,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:07,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:07,724 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:07,782 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:01:07,786 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:07,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:07,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:07,809 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:09,061 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-11-21 12:01:09,061 INFO L567 ElimStorePlain]: treesize reduction 176, result has 56.7 percent of original size [2019-11-21 12:01:09,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-21 12:01:09,062 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:384, output treesize:230 [2019-11-21 12:01:09,849 WARN L192 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-21 12:01:09,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:01:09,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:01:09,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:01:09,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:01:09,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:01:09,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:01:09,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:09,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:01:09,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:09,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:09,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:01:10,017 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 12:01:13,083 WARN L192 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 103 DAG size of output: 45 [2019-11-21 12:01:13,128 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:01:13,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:13,607 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-21 12:01:13,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:13,643 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:01:13,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:14,020 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-21 12:01:14,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:14,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:14,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:14,037 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:14,395 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-21 12:01:14,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:14,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:14,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:14,415 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:14,770 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 12:01:14,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:14,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:14,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:14,789 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:15,143 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-21 12:01:15,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:15,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:15,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:15,161 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:15,458 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-21 12:01:15,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:15,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:15,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:15,472 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:15,731 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-21 12:01:15,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:15,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:15,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:15,743 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:15,980 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 12:01:15,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:15,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-21 12:01:15,980 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:352, output treesize:198 [2019-11-21 12:01:16,446 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 12:01:17,054 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:01:17,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1155029922] [2019-11-21 12:01:17,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:01:17,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 15] imperfect sequences [] total 31 [2019-11-21 12:01:17,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615634116] [2019-11-21 12:01:17,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-21 12:01:17,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:01:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-21 12:01:17,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-11-21 12:01:17,056 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 32 states. [2019-11-21 12:01:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:01:23,322 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-11-21 12:01:23,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-21 12:01:23,324 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-21 12:01:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:01:23,325 INFO L225 Difference]: With dead ends: 89 [2019-11-21 12:01:23,325 INFO L226 Difference]: Without dead ends: 89 [2019-11-21 12:01:23,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2019-11-21 12:01:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-21 12:01:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2019-11-21 12:01:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-21 12:01:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-11-21 12:01:23,330 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 40 [2019-11-21 12:01:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:01:23,330 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-11-21 12:01:23,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-21 12:01:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-11-21 12:01:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-21 12:01:23,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:01:23,332 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:01:23,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:01:23,537 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_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:01:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:01:23,538 INFO L82 PathProgramCache]: Analyzing trace with hash -55407982, now seen corresponding path program 1 times [2019-11-21 12:01:23,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:01:23,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [465869186] [2019-11-21 12:01:23,540 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:01:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:01:24,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-21 12:01:24,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:01:24,093 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:01:24,093 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:01:24,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:24,135 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2019-11-21 12:01:24,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:24,136 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:01:24,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:33 [2019-11-21 12:01:24,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:01:24,164 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:01:24,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:24,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:24,181 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:01:24,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:24,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:24,189 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:01:24,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2019-11-21 12:01:24,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 9 [2019-11-21 12:01:24,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:24,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:24,292 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:01:24,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2019-11-21 12:01:24,553 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:01:24,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:24,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:24,584 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:01:24,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-21 12:01:24,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:24,682 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:01:24,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:24,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:24,727 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:01:24,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-21 12:01:24,822 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_267|], 6=[|v_#memory_$Pointer$.base_315|]} [2019-11-21 12:01:24,830 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:01:24,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:24,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:24,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:01:24,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:24,942 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:01:24,942 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:25,042 INFO L567 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-11-21 12:01:25,043 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:01:25,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2019-11-21 12:01:25,468 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-21 12:01:25,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:25,824 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:25,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:25,840 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 29 [2019-11-21 12:01:25,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:25,903 INFO L567 ElimStorePlain]: treesize reduction 9, result has 89.5 percent of original size [2019-11-21 12:01:25,910 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-21 12:01:25,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:25,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:25,936 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:01:25,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:62 [2019-11-21 12:01:26,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 9 [2019-11-21 12:01:26,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:26,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:26,042 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:01:26,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:63 [2019-11-21 12:01:26,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:26,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 35 [2019-11-21 12:01:26,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:26,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:01:26,363 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:01:26,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:19 [2019-11-21 12:01:26,613 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:01:26,613 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:01:27,369 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-21 12:01:27,478 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-21 12:01:27,664 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:01:27,822 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:01:28,099 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 12:01:28,388 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-21 12:01:28,573 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 12:01:28,881 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-21 12:01:29,095 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:01:29,209 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-21 12:01:29,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:29,283 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-11-21 12:01:29,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:29,284 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:01:29,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:37 [2019-11-21 12:01:29,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:29,883 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-21 12:01:29,984 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-21 12:01:30,151 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:01:30,321 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:01:30,586 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 12:01:30,695 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 12:01:30,913 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-21 12:01:31,077 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 12:01:31,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,104 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,139 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,151 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,160 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,177 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,195 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,203 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,214 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,224 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,232 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,241 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,255 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,280 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,308 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,335 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,358 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,372 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,388 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,399 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,411 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,435 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:31,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:01:31,455 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-21 12:01:32,256 WARN L192 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-11-21 12:01:32,257 INFO L567 ElimStorePlain]: treesize reduction 395, result has 62.3 percent of original size [2019-11-21 12:01:32,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2019-11-21 12:01:32,258 INFO L221 ElimStorePlain]: Needed 17 recursive calls to eliminate 1 variables, input treesize:1369, output treesize:654 [2019-11-21 12:01:32,258 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-21 12:01:32,693 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-11-21 12:01:32,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 12:01:32,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:01:32,703 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 33 [2019-11-21 12:01:32,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:01:32,935 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 12:01:32,942 INFO L168 Benchmark]: Toolchain (without parser) took 278307.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -67.3 MB). Peak memory consumption was 145.0 MB. Max. memory is 11.5 GB. [2019-11-21 12:01:32,942 INFO L168 Benchmark]: CDTParser took 0.28 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:01:32,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 993.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-21 12:01:32,943 INFO L168 Benchmark]: Boogie Preprocessor took 123.82 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:01:32,945 INFO L168 Benchmark]: RCFGBuilder took 1651.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.0 MB in the end (delta: 110.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. [2019-11-21 12:01:32,946 INFO L168 Benchmark]: TraceAbstraction took 275533.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 987.0 MB in the beginning and 1.0 GB in the end (delta: -25.9 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-11-21 12:01:32,950 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.28 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 993.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.82 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 1651.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.0 MB in the end (delta: 110.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275533.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 987.0 MB in the beginning and 1.0 GB in the end (delta: -25.9 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...