./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3c39aff9 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_test22_4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fb52f5a8769e751d5dc39d93dc642433ae2f5b ............................................................................................................................ Execution finished normally 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_test22_4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fb52f5a8769e751d5dc39d93dc642433ae2f5b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3c39aff [2019-11-27 18:58:24,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:58:24,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:58:24,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:58:24,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:58:24,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:58:24,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:58:24,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:58:24,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:58:24,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:58:24,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:58:24,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:58:24,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:58:24,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:58:24,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:58:24,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:58:24,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:58:24,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:58:24,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:58:24,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:58:24,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:58:24,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:58:24,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:58:24,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:58:24,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:58:24,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:58:24,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:58:24,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:58:24,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:58:24,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:58:24,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:58:24,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:58:24,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:58:24,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:58:24,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:58:24,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:58:24,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:58:24,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:58:24,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:58:24,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:58:24,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:58:24,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-27 18:58:24,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:58:24,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:58:24,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:58:24,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:58:24,625 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:58:24,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:58:24,628 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:58:24,628 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:58:24,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:58:24,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:58:24,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:58:24,629 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:58:24,629 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:58:24,630 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:58:24,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:58:24,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:58:24,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:58:24,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:58:24,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:58:24,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:58:24,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:58:24,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:58:24,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:58:24,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:58:24,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:58:24,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 18:58:24,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 18:58:24,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9fb52f5a8769e751d5dc39d93dc642433ae2f5b [2019-11-27 18:58:24,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:58:24,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:58:24,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:58:24,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:58:24,948 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:58:24,949 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-27 18:58:25,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b7e4908d/4d77bb75e33e41d99b1ab0380fe86e20/FLAG3dd42e348 [2019-11-27 18:58:25,508 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:58:25,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-27 18:58:25,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b7e4908d/4d77bb75e33e41d99b1ab0380fe86e20/FLAG3dd42e348 [2019-11-27 18:58:25,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b7e4908d/4d77bb75e33e41d99b1ab0380fe86e20 [2019-11-27 18:58:25,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:58:25,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:58:25,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:58:25,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:58:25,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:58:25,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:58:25" (1/1) ... [2019-11-27 18:58:25,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5b136e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:25, skipping insertion in model container [2019-11-27 18:58:25,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:58:25" (1/1) ... [2019-11-27 18:58:25,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:58:25,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:58:26,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:58:26,407 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-27 18:58:26,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@35768228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:26, skipping insertion in model container [2019-11-27 18:58:26,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:58:26,409 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 18:58:26,412 INFO L168 Benchmark]: Toolchain (without parser) took 637.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:26,413 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:58:26,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 18:58:26,416 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 634.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-3c39aff [2019-11-27 18:58:28,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:58:28,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:58:28,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:58:28,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:58:28,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:58:28,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:58:28,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:58:28,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:58:28,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:58:28,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:58:28,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:58:28,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:58:28,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:58:28,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:58:28,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:58:28,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:58:28,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:58:28,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:58:28,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:58:28,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:58:28,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:58:28,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:58:28,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:58:28,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:58:28,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:58:28,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:58:28,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:58:28,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:58:28,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:58:28,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:58:28,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:58:28,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:58:28,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:58:28,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:58:28,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:58:28,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:58:28,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:58:28,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:58:28,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:58:28,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:58:28,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-27 18:58:28,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:58:28,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:58:28,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:58:28,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:58:28,413 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:58:28,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:58:28,414 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:58:28,414 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 18:58:28,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:58:28,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:58:28,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:58:28,416 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 18:58:28,416 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 18:58:28,417 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 18:58:28,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:58:28,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 18:58:28,418 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 18:58:28,418 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 18:58:28,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:58:28,419 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:58:28,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:58:28,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:58:28,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:58:28,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:58:28,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:58:28,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:58:28,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:58:28,421 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 18:58:28,421 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 18:58:28,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 18:58:28,422 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9fb52f5a8769e751d5dc39d93dc642433ae2f5b [2019-11-27 18:58:28,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:58:28,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:58:28,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:58:28,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:58:28,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:58:28,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-27 18:58:28,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3d8df2e/5ae07ce2894343529daa1fcac9bbbba1/FLAG5b4aecaac [2019-11-27 18:58:29,418 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:58:29,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-27 18:58:29,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3d8df2e/5ae07ce2894343529daa1fcac9bbbba1/FLAG5b4aecaac [2019-11-27 18:58:29,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3d8df2e/5ae07ce2894343529daa1fcac9bbbba1 [2019-11-27 18:58:29,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:58:29,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 18:58:29,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:58:29,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:58:29,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:58:29,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:58:29" (1/1) ... [2019-11-27 18:58:29,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33519a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:29, skipping insertion in model container [2019-11-27 18:58:29,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:58:29" (1/1) ... [2019-11-27 18:58:29,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:58:29,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:58:30,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:58:30,206 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 18:58:30,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:58:30,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:58:30,312 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:58:30,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:58:30,519 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:58:30,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30 WrapperNode [2019-11-27 18:58:30,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:58:30,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:58:30,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:58:30,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:58:30,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (1/1) ... [2019-11-27 18:58:30,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (1/1) ... [2019-11-27 18:58:30,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (1/1) ... [2019-11-27 18:58:30,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (1/1) ... [2019-11-27 18:58:30,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (1/1) ... [2019-11-27 18:58:30,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (1/1) ... [2019-11-27 18:58:30,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (1/1) ... [2019-11-27 18:58:30,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:58:30,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:58:30,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:58:30,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:58:30,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (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-27 18:58:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 18:58:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:58:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:58:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:58:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 18:58:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 18:58:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-27 18:58:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-27 18:58:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-27 18:58:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-27 18:58:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-27 18:58:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-27 18:58:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-27 18:58:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:58:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-27 18:58:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-27 18:58:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-27 18:58:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-27 18:58:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-27 18:58:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-27 18:58:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-27 18:58:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-27 18:58:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-27 18:58:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-27 18:58:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-27 18:58:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-27 18:58:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-27 18:58:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-27 18:58:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-27 18:58:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-27 18:58:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-27 18:58:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-27 18:58:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-27 18:58:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-27 18:58:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-27 18:58:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-27 18:58:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-27 18:58:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-27 18:58:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-27 18:58:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-27 18:58:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-27 18:58:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-27 18:58:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-27 18:58:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-27 18:58:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-27 18:58:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 18:58:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-27 18:58:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 18:58:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-27 18:58:30,713 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 18:58:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 18:58:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 18:58:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 18:58:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 18:58:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 18:58:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 18:58:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 18:58:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 18:58:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 18:58:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 18:58:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 18:58:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 18:58:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 18:58:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 18:58:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 18:58:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 18:58:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 18:58:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-27 18:58:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-27 18:58:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-27 18:58:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 18:58:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 18:58:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 18:58:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 18:58:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 18:58:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 18:58:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 18:58:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 18:58:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 18:58:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 18:58:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 18:58:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 18:58:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 18:58:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 18:58:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 18:58:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 18:58:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 18:58:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 18:58:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 18:58:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 18:58:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 18:58:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 18:58:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 18:58:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 18:58:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 18:58:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 18:58:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 18:58:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 18:58:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 18:58:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 18:58:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 18:58:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 18:58:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 18:58:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 18:58:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 18:58:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 18:58:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 18:58:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 18:58:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 18:58:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 18:58:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 18:58:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 18:58:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 18:58:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 18:58:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 18:58:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 18:58:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 18:58:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 18:58:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 18:58:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 18:58:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 18:58:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 18:58:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 18:58:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 18:58:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 18:58:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 18:58:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 18:58:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 18:58:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 18:58:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 18:58:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 18:58:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 18:58:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 18:58:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 18:58:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 18:58:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 18:58:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 18:58:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 18:58:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 18:58:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 18:58:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 18:58:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 18:58:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 18:58:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 18:58:30,733 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 18:58:30,733 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 18:58:30,733 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 18:58:30,733 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 18:58:30,733 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 18:58:30,734 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 18:58:30,734 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 18:58:30,734 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 18:58:30,734 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 18:58:30,734 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 18:58:30,735 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 18:58:30,735 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 18:58:30,735 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-27 18:58:30,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 18:58:30,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-27 18:58:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-27 18:58:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-27 18:58:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-27 18:58:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-27 18:58:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:58:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-27 18:58:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 18:58:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-27 18:58:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 18:58:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-27 18:58:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-27 18:58:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-27 18:58:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 18:58:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-27 18:58:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-27 18:58:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-27 18:58:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-27 18:58:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-27 18:58:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-27 18:58:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 18:58:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-27 18:58:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-27 18:58:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-27 18:58:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-27 18:58:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-27 18:58:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 18:58:30,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 18:58:30,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-27 18:58:30,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-27 18:58:30,741 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-27 18:58:30,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-27 18:58:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-27 18:58:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-27 18:58:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-27 18:58:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-27 18:58:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-27 18:58:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-27 18:58:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-27 18:58:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-27 18:58:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-27 18:58:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-27 18:58:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-27 18:58:30,744 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-27 18:58:30,744 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-27 18:58:30,744 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-27 18:58:30,744 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-27 18:58:30,744 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-27 18:58:30,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 18:58:30,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 18:58:30,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 18:58:30,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 18:58:30,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:58:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 18:58:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-27 18:58:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-27 18:58:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-27 18:58:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-27 18:58:31,390 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:58:31,756 WARN L749 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 18:58:32,123 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:58:32,124 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-27 18:58:32,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:58:32 BoogieIcfgContainer [2019-11-27 18:58:32,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:58:32,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:58:32,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:58:32,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:58:32,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:58:29" (1/3) ... [2019-11-27 18:58:32,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b966302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:58:32, skipping insertion in model container [2019-11-27 18:58:32,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:58:30" (2/3) ... [2019-11-27 18:58:32,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b966302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:58:32, skipping insertion in model container [2019-11-27 18:58:32,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:58:32" (3/3) ... [2019-11-27 18:58:32,134 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2019-11-27 18:58:32,144 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:58:32,152 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-27 18:58:32,165 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-27 18:58:32,186 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:58:32,187 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 18:58:32,187 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:58:32,187 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:58:32,187 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:58:32,188 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:58:32,188 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:58:32,188 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:58:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2019-11-27 18:58:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:58:32,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:32,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:32,224 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:32,231 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-27 18:58:32,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:32,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817824424] [2019-11-27 18:58:32,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:32,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:58:32,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:32,508 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-27 18:58:32,508 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:32,519 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:32,519 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:32,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:58:32,548 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-27 18:58:32,549 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:32,605 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-27 18:58:32,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817824424] [2019-11-27 18:58:32,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:32,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 18:58:32,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438579792] [2019-11-27 18:58:32,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:58:32,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:58:32,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:58:32,633 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 5 states. [2019-11-27 18:58:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:32,987 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-27 18:58:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:58:32,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 18:58:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:33,029 INFO L225 Difference]: With dead ends: 160 [2019-11-27 18:58:33,036 INFO L226 Difference]: Without dead ends: 157 [2019-11-27 18:58:33,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:58:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-27 18:58:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2019-11-27 18:58:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-27 18:58:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2019-11-27 18:58:33,127 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 17 [2019-11-27 18:58:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:33,128 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2019-11-27 18:58:33,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:58:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2019-11-27 18:58:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:58:33,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:33,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:33,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 18:58:33,349 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-27 18:58:33,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:33,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62825686] [2019-11-27 18:58:33,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:33,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:58:33,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:33,521 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-27 18:58:33,521 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:33,533 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:33,534 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:33,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:58:33,596 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-27 18:58:33,596 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:33,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62825686] [2019-11-27 18:58:33,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:33,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-27 18:58:33,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952491638] [2019-11-27 18:58:33,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:58:33,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:33,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:58:33,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:58:33,977 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand 10 states. [2019-11-27 18:58:34,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:34,723 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-27 18:58:34,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:58:34,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-27 18:58:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:34,731 INFO L225 Difference]: With dead ends: 156 [2019-11-27 18:58:34,731 INFO L226 Difference]: Without dead ends: 156 [2019-11-27 18:58:34,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:58:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-27 18:58:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2019-11-27 18:58:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-27 18:58:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2019-11-27 18:58:34,745 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 17 [2019-11-27 18:58:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:34,746 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2019-11-27 18:58:34,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:58:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2019-11-27 18:58:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 18:58:34,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:34,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:34,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 18:58:34,959 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:34,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-27 18:58:34,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:34,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832980660] [2019-11-27 18:58:34,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:35,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:58:35,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:35,118 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-27 18:58:35,118 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:35,172 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-27 18:58:35,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832980660] [2019-11-27 18:58:35,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:35,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:58:35,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529539779] [2019-11-27 18:58:35,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:58:35,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:58:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:58:35,176 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 5 states. [2019-11-27 18:58:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:35,216 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2019-11-27 18:58:35,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:58:35,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 18:58:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:35,221 INFO L225 Difference]: With dead ends: 150 [2019-11-27 18:58:35,224 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 18:58:35,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:58:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 18:58:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-27 18:58:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-27 18:58:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2019-11-27 18:58:35,250 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 17 [2019-11-27 18:58:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:35,250 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2019-11-27 18:58:35,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:58:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2019-11-27 18:58:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 18:58:35,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:35,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:35,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 18:58:35,456 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 300911328, now seen corresponding path program 1 times [2019-11-27 18:58:35,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:35,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681919217] [2019-11-27 18:58:35,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:35,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:58:35,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:35,639 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-27 18:58:35,640 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:35,731 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-27 18:58:35,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681919217] [2019-11-27 18:58:35,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:35,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 18:58:35,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684143412] [2019-11-27 18:58:35,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:58:35,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:58:35,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:58:35,736 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 5 states. [2019-11-27 18:58:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:35,768 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2019-11-27 18:58:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 18:58:35,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-27 18:58:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:35,773 INFO L225 Difference]: With dead ends: 150 [2019-11-27 18:58:35,774 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 18:58:35,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-27 18:58:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 18:58:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-27 18:58:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-27 18:58:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2019-11-27 18:58:35,795 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 29 [2019-11-27 18:58:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:35,795 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2019-11-27 18:58:35,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:58:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2019-11-27 18:58:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 18:58:35,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:35,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:36,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 18:58:36,022 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash -696161025, now seen corresponding path program 1 times [2019-11-27 18:58:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:36,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719003038] [2019-11-27 18:58:36,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:36,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 18:58:36,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:36,267 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-27 18:58:36,268 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:36,317 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-27 18:58:36,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719003038] [2019-11-27 18:58:36,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:36,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-27 18:58:36,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083550256] [2019-11-27 18:58:36,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 18:58:36,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 18:58:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 18:58:36,320 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 9 states. [2019-11-27 18:58:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:36,444 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2019-11-27 18:58:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:58:36,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-27 18:58:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:36,447 INFO L225 Difference]: With dead ends: 168 [2019-11-27 18:58:36,447 INFO L226 Difference]: Without dead ends: 168 [2019-11-27 18:58:36,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:58:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-27 18:58:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2019-11-27 18:58:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-27 18:58:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2019-11-27 18:58:36,457 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 29 [2019-11-27 18:58:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:36,457 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2019-11-27 18:58:36,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 18:58:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2019-11-27 18:58:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 18:58:36,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:36,459 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] [2019-11-27 18:58:36,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 18:58:36,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-27 18:58:36,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:36,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263625946] [2019-11-27 18:58:36,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:36,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 18:58:36,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:36,838 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-27 18:58:36,838 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:36,884 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-27 18:58:36,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263625946] [2019-11-27 18:58:36,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:36,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 18:58:36,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547471207] [2019-11-27 18:58:36,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 18:58:36,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:36,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 18:58:36,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 18:58:36,886 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand 6 states. [2019-11-27 18:58:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:36,937 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2019-11-27 18:58:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:58:36,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 18:58:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:36,940 INFO L225 Difference]: With dead ends: 168 [2019-11-27 18:58:36,941 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 18:58:36,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:58:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 18:58:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-27 18:58:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-27 18:58:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2019-11-27 18:58:36,962 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 32 [2019-11-27 18:58:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:36,963 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2019-11-27 18:58:36,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 18:58:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2019-11-27 18:58:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 18:58:36,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:36,972 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:37,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 18:58:37,186 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-27 18:58:37,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:37,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349754639] [2019-11-27 18:58:37,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:37,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:58:37,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:37,393 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:37,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349754639] [2019-11-27 18:58:37,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:58:37,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 18:58:37,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533733190] [2019-11-27 18:58:37,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:58:37,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:58:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:58:37,535 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand 10 states. [2019-11-27 18:58:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:37,746 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2019-11-27 18:58:37,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:58:37,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-27 18:58:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:37,749 INFO L225 Difference]: With dead ends: 172 [2019-11-27 18:58:37,750 INFO L226 Difference]: Without dead ends: 168 [2019-11-27 18:58:37,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-27 18:58:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-27 18:58:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-11-27 18:58:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-27 18:58:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions. [2019-11-27 18:58:37,758 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 34 [2019-11-27 18:58:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:37,759 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions. [2019-11-27 18:58:37,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:58:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions. [2019-11-27 18:58:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:58:37,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:37,760 INFO L410 BasicCegarLoop]: trace histogram [6, 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-27 18:58:37,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 18:58:37,969 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-27 18:58:37,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:37,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561963353] [2019-11-27 18:58:37,972 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:38,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:58:38,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:58:38,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:58:38,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:38,175 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-27 18:58:38,175 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:38,178 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:38,178 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:38,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:58:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-27 18:58:38,318 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-27 18:58:38,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561963353] [2019-11-27 18:58:38,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:38,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 18:58:38,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204875763] [2019-11-27 18:58:38,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:58:38,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:58:38,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:58:38,400 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 12 states. [2019-11-27 18:58:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:39,431 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2019-11-27 18:58:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:58:39,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-27 18:58:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:39,434 INFO L225 Difference]: With dead ends: 179 [2019-11-27 18:58:39,434 INFO L226 Difference]: Without dead ends: 179 [2019-11-27 18:58:39,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-27 18:58:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-27 18:58:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2019-11-27 18:58:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-27 18:58:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 174 transitions. [2019-11-27 18:58:39,444 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 174 transitions. Word has length 38 [2019-11-27 18:58:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:39,445 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 174 transitions. [2019-11-27 18:58:39,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:58:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 174 transitions. [2019-11-27 18:58:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:58:39,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:39,447 INFO L410 BasicCegarLoop]: trace histogram [6, 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-27 18:58:39,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 18:58:39,649 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-27 18:58:39,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:39,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246859037] [2019-11-27 18:58:39,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:39,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:58:39,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:39,923 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:40,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246859037] [2019-11-27 18:58:40,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:58:40,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 18:58:40,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594765077] [2019-11-27 18:58:40,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:58:40,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:58:40,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:58:40,320 INFO L87 Difference]: Start difference. First operand 167 states and 174 transitions. Second operand 18 states. [2019-11-27 18:58:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:41,375 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2019-11-27 18:58:41,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:58:41,375 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-27 18:58:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:41,377 INFO L225 Difference]: With dead ends: 179 [2019-11-27 18:58:41,377 INFO L226 Difference]: Without dead ends: 175 [2019-11-27 18:58:41,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-27 18:58:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-27 18:58:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-27 18:58:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-27 18:58:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2019-11-27 18:58:41,385 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 38 [2019-11-27 18:58:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:41,385 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2019-11-27 18:58:41,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:58:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2019-11-27 18:58:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 18:58:41,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:41,387 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-27 18:58:41,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 18:58:41,590 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1347385061, now seen corresponding path program 1 times [2019-11-27 18:58:41,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:41,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811375738] [2019-11-27 18:58:41,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:41,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:58:41,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:41,796 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:41,842 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-27 18:58:41,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811375738] [2019-11-27 18:58:41,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:41,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-27 18:58:41,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133025498] [2019-11-27 18:58:41,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 18:58:41,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 18:58:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:58:41,845 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand 7 states. [2019-11-27 18:58:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:41,896 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2019-11-27 18:58:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 18:58:41,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-27 18:58:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:41,898 INFO L225 Difference]: With dead ends: 184 [2019-11-27 18:58:41,898 INFO L226 Difference]: Without dead ends: 184 [2019-11-27 18:58:41,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:58:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-27 18:58:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-11-27 18:58:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-27 18:58:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 187 transitions. [2019-11-27 18:58:41,909 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 187 transitions. Word has length 40 [2019-11-27 18:58:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:41,909 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 187 transitions. [2019-11-27 18:58:41,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 18:58:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 187 transitions. [2019-11-27 18:58:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 18:58:41,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:41,911 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] [2019-11-27 18:58:42,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 18:58:42,118 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1156201438, now seen corresponding path program 1 times [2019-11-27 18:58:42,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:42,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784406393] [2019-11-27 18:58:42,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:42,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 18:58:42,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:42,256 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-27 18:58:42,256 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:42,421 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-27 18:58:42,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784406393] [2019-11-27 18:58:42,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:42,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 18:58:42,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27922113] [2019-11-27 18:58:42,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 18:58:42,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:42,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 18:58:42,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:58:42,427 INFO L87 Difference]: Start difference. First operand 180 states and 187 transitions. Second operand 3 states. [2019-11-27 18:58:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:42,625 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2019-11-27 18:58:42,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 18:58:42,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-27 18:58:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:42,629 INFO L225 Difference]: With dead ends: 191 [2019-11-27 18:58:42,629 INFO L226 Difference]: Without dead ends: 165 [2019-11-27 18:58:42,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 18:58:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-27 18:58:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-27 18:58:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-27 18:58:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 163 transitions. [2019-11-27 18:58:42,636 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 163 transitions. Word has length 38 [2019-11-27 18:58:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:42,636 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 163 transitions. [2019-11-27 18:58:42,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 18:58:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 163 transitions. [2019-11-27 18:58:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-27 18:58:42,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:42,638 INFO L410 BasicCegarLoop]: trace histogram [14, 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-27 18:58:42,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 18:58:42,843 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:42,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-27 18:58:42,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:42,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332402055] [2019-11-27 18:58:42,845 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:43,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:58:43,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:58:43,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:58:43,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:43,040 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-27 18:58:43,043 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:43,052 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:43,053 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:43,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:58:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-27 18:58:43,304 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-27 18:58:44,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332402055] [2019-11-27 18:58:44,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:44,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 18:58:44,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215944525] [2019-11-27 18:58:44,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:58:44,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:44,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:58:44,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:58:44,212 INFO L87 Difference]: Start difference. First operand 157 states and 163 transitions. Second operand 23 states. [2019-11-27 18:58:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:47,068 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2019-11-27 18:58:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:58:47,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-27 18:58:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:47,070 INFO L225 Difference]: With dead ends: 156 [2019-11-27 18:58:47,070 INFO L226 Difference]: Without dead ends: 156 [2019-11-27 18:58:47,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-27 18:58:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-27 18:58:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-27 18:58:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 18:58:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2019-11-27 18:58:47,076 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 46 [2019-11-27 18:58:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:47,077 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2019-11-27 18:58:47,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:58:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2019-11-27 18:58:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-27 18:58:47,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:47,078 INFO L410 BasicCegarLoop]: trace histogram [14, 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-27 18:58:47,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 18:58:47,281 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-27 18:58:47,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:47,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766820523] [2019-11-27 18:58:47,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:47,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 18:58:47,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:47,648 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:58:48,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766820523] [2019-11-27 18:58:48,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:58:48,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-27 18:58:48,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059842663] [2019-11-27 18:58:48,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-27 18:58:48,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:48,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-27 18:58:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 18:58:48,576 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 34 states. [2019-11-27 18:58:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:49,346 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2019-11-27 18:58:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 18:58:49,347 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-27 18:58:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:49,349 INFO L225 Difference]: With dead ends: 162 [2019-11-27 18:58:49,349 INFO L226 Difference]: Without dead ends: 158 [2019-11-27 18:58:49,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-27 18:58:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-27 18:58:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-27 18:58:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-27 18:58:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 164 transitions. [2019-11-27 18:58:49,365 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 164 transitions. Word has length 51 [2019-11-27 18:58:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:49,365 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 164 transitions. [2019-11-27 18:58:49,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-27 18:58:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2019-11-27 18:58:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:58:49,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:49,366 INFO L410 BasicCegarLoop]: trace histogram [16, 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-27 18:58:49,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 18:58:49,567 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-27 18:58:49,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:49,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399185207] [2019-11-27 18:58:49,569 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:49,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 18:58:49,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:58:49,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:58:49,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:49,720 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-27 18:58:49,720 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:49,722 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:49,722 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:49,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:58:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:49,911 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:49,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399185207] [2019-11-27 18:58:49,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:49,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-27 18:58:49,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950697415] [2019-11-27 18:58:49,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:58:49,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:49,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:58:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:58:49,992 INFO L87 Difference]: Start difference. First operand 158 states and 164 transitions. Second operand 12 states. [2019-11-27 18:58:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:50,900 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2019-11-27 18:58:50,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:58:50,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-27 18:58:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:50,903 INFO L225 Difference]: With dead ends: 168 [2019-11-27 18:58:50,903 INFO L226 Difference]: Without dead ends: 168 [2019-11-27 18:58:50,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-27 18:58:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-27 18:58:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2019-11-27 18:58:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 18:58:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2019-11-27 18:58:50,909 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 53 [2019-11-27 18:58:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:50,910 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2019-11-27 18:58:50,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:58:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2019-11-27 18:58:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:58:50,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:50,911 INFO L410 BasicCegarLoop]: trace histogram [16, 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-27 18:58:51,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 18:58:51,120 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:51,120 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-27 18:58:51,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:51,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574760044] [2019-11-27 18:58:51,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:51,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:58:51,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:51,337 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-27 18:58:51,337 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:51,342 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:51,342 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:51,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:58:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:51,569 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:52,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574760044] [2019-11-27 18:58:52,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:52,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-27 18:58:52,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785022451] [2019-11-27 18:58:52,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 18:58:52,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:52,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 18:58:52,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:58:52,385 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 23 states. [2019-11-27 18:58:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:55,384 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2019-11-27 18:58:55,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:58:55,385 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-27 18:58:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:55,386 INFO L225 Difference]: With dead ends: 154 [2019-11-27 18:58:55,386 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 18:58:55,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-27 18:58:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 18:58:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-27 18:58:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-27 18:58:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2019-11-27 18:58:55,394 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 53 [2019-11-27 18:58:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:55,394 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2019-11-27 18:58:55,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 18:58:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2019-11-27 18:58:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-27 18:58:55,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:55,396 INFO L410 BasicCegarLoop]: trace histogram [16, 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-27 18:58:55,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 18:58:55,607 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2141011139, now seen corresponding path program 1 times [2019-11-27 18:58:55,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:55,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574281056] [2019-11-27 18:58:55,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:55,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:58:55,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:55,828 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:55,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574281056] [2019-11-27 18:58:55,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:55,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-27 18:58:55,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253358972] [2019-11-27 18:58:55,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:58:55,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:58:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:58:55,942 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 8 states. [2019-11-27 18:58:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:55,993 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2019-11-27 18:58:55,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:58:55,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-27 18:58:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:55,994 INFO L225 Difference]: With dead ends: 156 [2019-11-27 18:58:55,994 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 18:58:55,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-27 18:58:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 18:58:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-27 18:58:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-27 18:58:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2019-11-27 18:58:56,000 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 58 [2019-11-27 18:58:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:56,001 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2019-11-27 18:58:56,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:58:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2019-11-27 18:58:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-27 18:58:56,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:56,002 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 1, 1, 1] [2019-11-27 18:58:56,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 18:58:56,215 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:56,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1283825080, now seen corresponding path program 1 times [2019-11-27 18:58:56,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:56,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589357525] [2019-11-27 18:58:56,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:56,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 18:58:56,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:56,486 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:56,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:58:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:56,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589357525] [2019-11-27 18:58:56,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:56,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-27 18:58:56,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983062367] [2019-11-27 18:58:56,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 18:58:56,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 18:58:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:58:56,751 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 11 states. [2019-11-27 18:58:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:56,899 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2019-11-27 18:58:56,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:58:56,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-27 18:58:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:56,901 INFO L225 Difference]: With dead ends: 158 [2019-11-27 18:58:56,901 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 18:58:56,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-27 18:58:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 18:58:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-27 18:58:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-27 18:58:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2019-11-27 18:58:56,907 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 63 [2019-11-27 18:58:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:56,907 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2019-11-27 18:58:56,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 18:58:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2019-11-27 18:58:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-27 18:58:56,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:56,909 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:57,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 18:58:57,110 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:57,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1405000591, now seen corresponding path program 1 times [2019-11-27 18:58:57,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:57,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768635410] [2019-11-27 18:58:57,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:57,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 18:58:57,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:57,343 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-27 18:58:57,344 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:57,345 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:57,345 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:57,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:58:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:57,564 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:58:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:58:57,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768635410] [2019-11-27 18:58:57,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:58:57,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-27 18:58:57,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617371905] [2019-11-27 18:58:57,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 18:58:57,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:58:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 18:58:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-27 18:58:57,746 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 17 states. [2019-11-27 18:58:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:58:59,219 INFO L93 Difference]: Finished difference Result 164 states and 167 transitions. [2019-11-27 18:58:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-27 18:58:59,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-11-27 18:58:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:58:59,222 INFO L225 Difference]: With dead ends: 164 [2019-11-27 18:58:59,222 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 18:58:59,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-27 18:58:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 18:58:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-27 18:58:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-27 18:58:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-11-27 18:58:59,236 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 74 [2019-11-27 18:58:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:58:59,238 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-11-27 18:58:59,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 18:58:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-11-27 18:58:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-27 18:58:59,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:58:59,242 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:58:59,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 18:58:59,456 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:58:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:58:59,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1405000592, now seen corresponding path program 1 times [2019-11-27 18:58:59,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:58:59,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067098027] [2019-11-27 18:58:59,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-27 18:58:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:58:59,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-27 18:58:59,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:58:59,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 18:58:59,806 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:58:59,815 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:58:59,815 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:58:59,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:59:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:00,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:02,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067098027] [2019-11-27 18:59:02,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:02,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-27 18:59:02,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106045575] [2019-11-27 18:59:02,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-27 18:59:02,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-27 18:59:02,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-27 18:59:02,141 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 33 states. [2019-11-27 18:59:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:06,501 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-11-27 18:59:06,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:59:06,502 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-11-27 18:59:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:06,503 INFO L225 Difference]: With dead ends: 150 [2019-11-27 18:59:06,503 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 18:59:06,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-27 18:59:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 18:59:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-27 18:59:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-27 18:59:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-11-27 18:59:06,508 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 74 [2019-11-27 18:59:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:06,508 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-11-27 18:59:06,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-27 18:59:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-11-27 18:59:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-27 18:59:06,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:06,510 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 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-27 18:59:06,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 18:59:06,715 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:06,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1519816277, now seen corresponding path program 1 times [2019-11-27 18:59:06,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:06,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096242052] [2019-11-27 18:59:06,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:06,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:59:06,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:07,054 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:07,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:07,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096242052] [2019-11-27 18:59:07,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:07,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-27 18:59:07,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826813376] [2019-11-27 18:59:07,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:59:07,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:07,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:59:07,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:59:07,314 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 14 states. [2019-11-27 18:59:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:07,461 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2019-11-27 18:59:07,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:59:07,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2019-11-27 18:59:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:07,462 INFO L225 Difference]: With dead ends: 156 [2019-11-27 18:59:07,462 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 18:59:07,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-27 18:59:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 18:59:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-27 18:59:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-27 18:59:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2019-11-27 18:59:07,466 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 85 [2019-11-27 18:59:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:07,467 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2019-11-27 18:59:07,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:59:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2019-11-27 18:59:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 18:59:07,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:07,468 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 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-27 18:59:07,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-27 18:59:07,680 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2050797402, now seen corresponding path program 1 times [2019-11-27 18:59:07,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:07,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336230570] [2019-11-27 18:59:07,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:07,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-27 18:59:07,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:07,967 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-27 18:59:07,967 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:07,969 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:07,969 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:07,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:59:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:08,323 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:08,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336230570] [2019-11-27 18:59:08,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:08,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-27 18:59:08,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139935159] [2019-11-27 18:59:08,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 18:59:08,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:08,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 18:59:08,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-27 18:59:08,558 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand 17 states. [2019-11-27 18:59:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:09,848 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2019-11-27 18:59:09,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:59:09,849 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-11-27 18:59:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:09,851 INFO L225 Difference]: With dead ends: 164 [2019-11-27 18:59:09,851 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 18:59:09,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 173 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-27 18:59:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 18:59:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2019-11-27 18:59:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-27 18:59:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-11-27 18:59:09,857 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 98 [2019-11-27 18:59:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:09,857 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2019-11-27 18:59:09,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 18:59:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2019-11-27 18:59:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 18:59:09,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:09,859 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 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-27 18:59:10,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-27 18:59:10,062 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2050797403, now seen corresponding path program 1 times [2019-11-27 18:59:10,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:10,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286368587] [2019-11-27 18:59:10,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:10,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-27 18:59:10,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:10,449 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-27 18:59:10,450 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:10,457 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:10,458 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:10,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:59:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:10,961 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:12,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286368587] [2019-11-27 18:59:12,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:12,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-27 18:59:12,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523152701] [2019-11-27 18:59:12,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-27 18:59:12,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-27 18:59:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-27 18:59:12,670 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 33 states. [2019-11-27 18:59:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:16,682 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2019-11-27 18:59:16,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:59:16,686 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2019-11-27 18:59:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:16,687 INFO L225 Difference]: With dead ends: 146 [2019-11-27 18:59:16,687 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 18:59:16,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 158 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-27 18:59:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 18:59:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-27 18:59:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 18:59:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2019-11-27 18:59:16,692 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 98 [2019-11-27 18:59:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:16,693 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2019-11-27 18:59:16,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-27 18:59:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2019-11-27 18:59:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-27 18:59:16,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:16,694 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 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-27 18:59:16,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-27 18:59:16,897 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash -797927977, now seen corresponding path program 1 times [2019-11-27 18:59:16,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:16,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577231211] [2019-11-27 18:59:16,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:17,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 18:59:17,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:17,213 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:17,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577231211] [2019-11-27 18:59:17,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:17,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-27 18:59:17,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239078057] [2019-11-27 18:59:17,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 18:59:17,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:17,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 18:59:17,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:59:17,496 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 11 states. [2019-11-27 18:59:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:17,582 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-11-27 18:59:17,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:59:17,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-11-27 18:59:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:17,584 INFO L225 Difference]: With dead ends: 148 [2019-11-27 18:59:17,584 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 18:59:17,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-27 18:59:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 18:59:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-27 18:59:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 18:59:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-11-27 18:59:17,590 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 96 [2019-11-27 18:59:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:17,590 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-11-27 18:59:17,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 18:59:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-11-27 18:59:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-27 18:59:17,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:17,592 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:17,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-27 18:59:17,805 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 693754465, now seen corresponding path program 1 times [2019-11-27 18:59:17,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:17,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829329297] [2019-11-27 18:59:17,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:18,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-27 18:59:18,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:18,201 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-27 18:59:18,202 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:18,203 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:18,203 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:18,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 18:59:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:18,715 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:19,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829329297] [2019-11-27 18:59:19,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:19,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-27 18:59:19,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830294935] [2019-11-27 18:59:19,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-27 18:59:19,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-27 18:59:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-27 18:59:19,024 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 21 states. [2019-11-27 18:59:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:20,690 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2019-11-27 18:59:20,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:59:20,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2019-11-27 18:59:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:20,693 INFO L225 Difference]: With dead ends: 156 [2019-11-27 18:59:20,693 INFO L226 Difference]: Without dead ends: 156 [2019-11-27 18:59:20,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 191 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-27 18:59:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-27 18:59:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2019-11-27 18:59:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 18:59:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-11-27 18:59:20,699 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 111 [2019-11-27 18:59:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:20,699 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-11-27 18:59:20,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-27 18:59:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-11-27 18:59:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-27 18:59:20,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:20,701 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:20,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-27 18:59:20,912 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:20,913 INFO L82 PathProgramCache]: Analyzing trace with hash 693754466, now seen corresponding path program 1 times [2019-11-27 18:59:20,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:20,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151216426] [2019-11-27 18:59:20,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:21,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-27 18:59:21,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:21,274 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-27 18:59:21,274 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:21,282 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:21,282 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:21,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 18:59:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:22,064 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:24,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151216426] [2019-11-27 18:59:24,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:24,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-27 18:59:24,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896669902] [2019-11-27 18:59:24,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-27 18:59:24,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:24,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-27 18:59:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-27 18:59:24,548 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 41 states. [2019-11-27 18:59:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:29,735 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2019-11-27 18:59:29,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:59:29,736 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 111 [2019-11-27 18:59:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:29,737 INFO L225 Difference]: With dead ends: 142 [2019-11-27 18:59:29,737 INFO L226 Difference]: Without dead ends: 142 [2019-11-27 18:59:29,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-27 18:59:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-27 18:59:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-27 18:59:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-27 18:59:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-11-27 18:59:29,742 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 111 [2019-11-27 18:59:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:29,743 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-11-27 18:59:29,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-27 18:59:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-11-27 18:59:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-27 18:59:29,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:29,745 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:29,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-27 18:59:29,946 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 256905644, now seen corresponding path program 1 times [2019-11-27 18:59:29,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:29,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696695697] [2019-11-27 18:59:29,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:30,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 18:59:30,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:31,320 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-27 18:59:32,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696695697] [2019-11-27 18:59:32,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:59:32,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-27 18:59:32,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645714962] [2019-11-27 18:59:32,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-27 18:59:32,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-27 18:59:32,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-27 18:59:32,239 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 40 states. [2019-11-27 18:59:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:59:34,726 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-11-27 18:59:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:59:34,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2019-11-27 18:59:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:59:34,728 INFO L225 Difference]: With dead ends: 141 [2019-11-27 18:59:34,728 INFO L226 Difference]: Without dead ends: 141 [2019-11-27 18:59:34,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-27 18:59:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-27 18:59:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-11-27 18:59:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-27 18:59:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2019-11-27 18:59:34,734 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 114 [2019-11-27 18:59:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:59:34,735 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2019-11-27 18:59:34,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-27 18:59:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2019-11-27 18:59:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-27 18:59:34,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:59:34,736 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:59:34,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-27 18:59:34,949 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-27 18:59:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:59:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash -155348315, now seen corresponding path program 1 times [2019-11-27 18:59:34,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:59:34,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24232121] [2019-11-27 18:59:34,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-11-27 18:59:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:59:35,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-27 18:59:35,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:59:35,543 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 14 treesize of output 10 [2019-11-27 18:59:35,543 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:35,552 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:35,552 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:35,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-27 18:59:35,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:35,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-27 18:59:35,622 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:35,657 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-27 18:59:35,657 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:35,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-27 18:59:48,189 WARN L192 SmtUtils]: Spent 12.47 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-27 18:59:48,190 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-27 18:59:48,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 37 treesize of output 81 [2019-11-27 18:59:48,192 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:48,250 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-27 18:59:48,250 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:48,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-27 18:59:48,391 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-27 18:59:48,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-27 18:59:48,392 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:48,440 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:48,440 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:48,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-27 18:59:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:59:49,276 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:59:49,778 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 18:59:51,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:51,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:53,931 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-27 18:59:54,000 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:59:54,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:59:54,160 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-27 18:59:54,160 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-27 18:59:54,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-27 18:59:54,168 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-27 18:59:54,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 51 treesize of output 21 [2019-11-27 18:59:54,169 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:54,170 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:54,170 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:54,171 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:59:54,171 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:54,171 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-27 18:59:56,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:59:56,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:59:56,507 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-27 18:59:56,509 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-27 18:59:56,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-27 18:59:56,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,771 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-27 18:59:56,772 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-27 18:59:56,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-27 18:59:56,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:59:56,780 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:59:56,988 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-27 18:59:56,989 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-27 18:59:56,989 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:57,031 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-27 18:59:57,031 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:59:57,032 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-27 18:59:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:59:58,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24232121] [2019-11-27 18:59:58,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:59:58,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-27 18:59:58,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194161780] [2019-11-27 18:59:58,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-27 18:59:58,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:59:58,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-27 18:59:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-27 18:59:58,598 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 55 states. [2019-11-27 19:00:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:00:08,706 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-27 19:00:08,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-27 19:00:08,707 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 117 [2019-11-27 19:00:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:00:08,707 INFO L225 Difference]: With dead ends: 60 [2019-11-27 19:00:08,707 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 19:00:08,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=257, Invalid=3403, Unknown=0, NotChecked=0, Total=3660 [2019-11-27 19:00:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 19:00:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 19:00:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 19:00:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 19:00:08,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2019-11-27 19:00:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:00:08,709 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 19:00:08,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-27 19:00:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 19:00:08,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 19:00:08,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-27 19:00:08,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:00:08 BoogieIcfgContainer [2019-11-27 19:00:08,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 19:00:08,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 19:00:08,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 19:00:08,919 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 19:00:08,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:58:32" (3/4) ... [2019-11-27 19:00:08,923 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 19:00:08,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-27 19:00:08,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-27 19:00:08,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_get [2019-11-27 19:00:08,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-27 19:00:08,933 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_put [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-27 19:00:08,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-27 19:00:08,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-27 19:00:08,948 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2019-11-27 19:00:08,949 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-27 19:00:08,949 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 19:00:08,949 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 19:00:08,950 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 19:00:09,029 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 19:00:09,030 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 19:00:09,031 INFO L168 Benchmark]: Toolchain (without parser) took 99344.69 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 556.8 MB). Free memory was 955.0 MB in the beginning and 1.5 GB in the end (delta: -548.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:09,032 INFO L168 Benchmark]: CDTParser took 0.29 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-27 19:00:09,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:09,032 INFO L168 Benchmark]: Boogie Preprocessor took 122.72 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-27 19:00:09,033 INFO L168 Benchmark]: RCFGBuilder took 1480.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.7 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:09,033 INFO L168 Benchmark]: TraceAbstraction took 96791.56 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.8 MB). Free memory was 993.7 MB in the beginning and 1.5 GB in the end (delta: -524.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 19:00:09,034 INFO L168 Benchmark]: Witness Printer took 111.32 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-11-27 19:00:09,042 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.29 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 833.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.72 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 1480.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.7 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96791.56 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.8 MB). Free memory was 993.7 MB in the beginning and 1.5 GB in the end (delta: -524.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 111.32 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 341 locations, 71 error locations. Result: SAFE, OverallTime: 96.7s, OverallIterations: 27, TraceHistogramMax: 16, AutomataDifference: 42.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3350 SDtfs, 1546 SDslu, 28036 SDs, 0 SdLazy, 15114 SolverSat, 427 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 33.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3323 GetRequests, 2739 SyntacticMatches, 67 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 25.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 97 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 1631 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3208 ConstructedInterpolants, 503 QuantifiedInterpolants, 1103791 SizeOfPredicates, 171 NumberOfNonLiveVariables, 6904 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 54 InterpolantComputations, 46 PerfectInterpolantSequences, 3788/4318 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...