./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer --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 098cac8041f427989b0fcb649de06793770da06a ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer --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 098cac8041f427989b0fcb649de06793770da06a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:07:05,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:07:05,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:07:05,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:07:05,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:07:05,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:07:05,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:07:05,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:07:05,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:07:05,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:07:05,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:07:05,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:07:05,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:07:05,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:07:05,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:07:05,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:07:05,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:07:05,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:07:05,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:07:05,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:07:05,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:07:05,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:07:05,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:07:05,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:07:05,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:07:05,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:07:05,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:07:05,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:07:05,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:07:05,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:07:05,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:07:05,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:07:05,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:07:05,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:07:05,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:07:05,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:07:05,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:07:05,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:07:05,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:07:05,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:07:05,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:07:05,633 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 14:07:05,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:07:05,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:07:05,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:07:05,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:07:05,643 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:07:05,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:07:05,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:07:05,645 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:07:05,645 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:07:05,645 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:07:05,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:07:05,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:07:05,645 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:07:05,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:07:05,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:07:05,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:07:05,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:07:05,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:07:05,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:07:05,646 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:07:05,646 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer 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 -> 098cac8041f427989b0fcb649de06793770da06a [2019-12-07 14:07:05,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:07:05,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:07:05,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:07:05,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:07:05,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:07:05,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-12-07 14:07:05,800 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data/179f92220/457b1d56243a4d2d8273610e82f0d695/FLAGd05cf8714 [2019-12-07 14:07:06,255 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:07:06,255 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-12-07 14:07:06,265 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data/179f92220/457b1d56243a4d2d8273610e82f0d695/FLAGd05cf8714 [2019-12-07 14:07:06,274 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data/179f92220/457b1d56243a4d2d8273610e82f0d695 [2019-12-07 14:07:06,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:07:06,277 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 14:07:06,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:07:06,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:07:06,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:07:06,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:07:06" (1/1) ... [2019-12-07 14:07:06,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa23573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:06, skipping insertion in model container [2019-12-07 14:07:06,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:07:06" (1/1) ... [2019-12-07 14:07:06,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:07:06,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:07:06,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:07:06,580 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-12-07 14:07:06,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@599ae583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:06, skipping insertion in model container [2019-12-07 14:07:06,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:07:06,581 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 14:07:06,582 INFO L168 Benchmark]: Toolchain (without parser) took 305.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:07:06,583 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:07:06,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:07:06,584 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 18.2 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.25-f470102 [2019-12-07 14:07:07,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:07:07,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:07:07,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:07:07,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:07:07,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:07:07,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:07:07,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:07:07,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:07:07,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:07:07,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:07:07,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:07:07,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:07:07,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:07:07,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:07:07,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:07:07,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:07:07,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:07:07,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:07:07,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:07:07,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:07:07,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:07:07,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:07:07,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:07:07,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:07:07,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:07:07,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:07:07,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:07:07,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:07:07,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:07:07,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:07:07,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:07:07,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:07:07,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:07:07,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:07:07,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:07:07,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:07:07,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:07:07,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:07:07,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:07:07,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:07:07,769 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 14:07:07,778 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:07:07,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:07:07,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:07:07,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:07:07,780 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:07:07,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:07:07,780 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:07:07,780 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:07:07,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:07:07,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:07:07,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:07:07,780 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:07:07,781 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:07:07,781 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:07:07,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:07:07,781 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:07:07,781 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:07:07,781 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:07:07,781 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:07:07,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:07:07,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:07:07,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:07:07,782 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:07:07,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:07:07,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:07:07,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:07:07,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:07:07,783 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 14:07:07,783 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:07:07,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:07:07,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:07:07,783 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer 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 -> 098cac8041f427989b0fcb649de06793770da06a [2019-12-07 14:07:07,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:07:07,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:07:07,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:07:07,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:07:07,958 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:07:07,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-12-07 14:07:07,995 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data/633ee0f8b/3c6b51d50fea47cca88f5f7925925a7f/FLAG074772307 [2019-12-07 14:07:08,393 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:07:08,393 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-12-07 14:07:08,405 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data/633ee0f8b/3c6b51d50fea47cca88f5f7925925a7f/FLAG074772307 [2019-12-07 14:07:08,413 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/data/633ee0f8b/3c6b51d50fea47cca88f5f7925925a7f [2019-12-07 14:07:08,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:07:08,416 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 14:07:08,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:07:08,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:07:08,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:07:08,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5dd555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08, skipping insertion in model container [2019-12-07 14:07:08,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:07:08,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:07:08,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:07:08,716 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 14:07:08,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:07:08,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:07:08,764 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:07:08,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:07:08,854 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:07:08,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08 WrapperNode [2019-12-07 14:07:08,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:07:08,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:07:08,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:07:08,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:07:08,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (1/1) ... [2019-12-07 14:07:08,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:07:08,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:07:08,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:07:08,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:07:08,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:08,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 14:07:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 14:07:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 14:07:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure probe3_6 [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 14:07:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 14:07:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 14:07:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 14:07:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 14:07:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 14:07:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 14:07:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 14:07:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 14:07:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 14:07:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 14:07:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 14:07:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure probe3_6 [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:07:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 14:07:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 14:07:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 14:07:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 14:07:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 14:07:09,323 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:07:09,577 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:07:09,847 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:07:09,847 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 14:07:09,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:07:09 BoogieIcfgContainer [2019-12-07 14:07:09,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:07:09,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:07:09,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:07:09,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:07:09,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:07:08" (1/3) ... [2019-12-07 14:07:09,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1079d5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:07:09, skipping insertion in model container [2019-12-07 14:07:09,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:07:08" (2/3) ... [2019-12-07 14:07:09,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1079d5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:07:09, skipping insertion in model container [2019-12-07 14:07:09,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:07:09" (3/3) ... [2019-12-07 14:07:09,853 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2.i [2019-12-07 14:07:09,860 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:07:09,865 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 86 error locations. [2019-12-07 14:07:09,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2019-12-07 14:07:09,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:07:09,884 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:07:09,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:07:09,885 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:07:09,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:07:09,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:07:09,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:07:09,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:07:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-07 14:07:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:07:09,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:09,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:09,905 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:09,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2083337596, now seen corresponding path program 1 times [2019-12-07 14:07:09,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:09,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407060401] [2019-12-07 14:07:09,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:10,044 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:07:10,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:10,081 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:10,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407060401] [2019-12-07 14:07:10,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:10,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 14:07:10,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851670744] [2019-12-07 14:07:10,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:07:10,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:10,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:07:10,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:07:10,155 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 5 states. [2019-12-07 14:07:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:10,236 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2019-12-07 14:07:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:07:10,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 14:07:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:10,245 INFO L225 Difference]: With dead ends: 94 [2019-12-07 14:07:10,245 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 14:07:10,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:07:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 14:07:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-12-07 14:07:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 14:07:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-12-07 14:07:10,278 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 20 [2019-12-07 14:07:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:10,278 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-12-07 14:07:10,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:07:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-12-07 14:07:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:07:10,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:10,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:10,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:07:10,480 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2015116195, now seen corresponding path program 1 times [2019-12-07 14:07:10,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:10,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159065829] [2019-12-07 14:07:10,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:10,589 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:07:10,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:10,665 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 14:07:10,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 14:07:10,666 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:10,690 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 14:07:10,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:10,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:10,695 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 14:07:10,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:10,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:07:10,718 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:10,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:10,720 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:10,721 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 14:07:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:10,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:10,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:10,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-12-07 14:07:10,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:10,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:10,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:10,795 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-12-07 14:07:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:10,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159065829] [2019-12-07 14:07:10,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:10,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:07:10,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218272988] [2019-12-07 14:07:10,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:07:10,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:07:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:07:10,815 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-12-07 14:07:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:10,949 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-12-07 14:07:10,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:07:10,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 14:07:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:10,952 INFO L225 Difference]: With dead ends: 111 [2019-12-07 14:07:10,952 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 14:07:10,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:07:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 14:07:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2019-12-07 14:07:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 14:07:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-12-07 14:07:10,964 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 20 [2019-12-07 14:07:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:10,964 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-12-07 14:07:10,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:07:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-12-07 14:07:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:07:10,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:10,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:11,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:07:11,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:11,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2015116196, now seen corresponding path program 1 times [2019-12-07 14:07:11,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:11,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856519184] [2019-12-07 14:07:11,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:11,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:07:11,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:11,330 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:11,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 14:07:11,331 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:11,347 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 14:07:11,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:11,348 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 14:07:11,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:07:11,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:11,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:11,364 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:11,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-12-07 14:07:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:11,374 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:11,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:11,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 14:07:11,489 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:11,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:11,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:11,512 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2019-12-07 14:07:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:11,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856519184] [2019-12-07 14:07:11,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:11,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 14:07:11,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116223344] [2019-12-07 14:07:11,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:07:11,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:11,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:07:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:07:11,568 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2019-12-07 14:07:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:11,760 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2019-12-07 14:07:11,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:07:11,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 14:07:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:11,762 INFO L225 Difference]: With dead ends: 125 [2019-12-07 14:07:11,762 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 14:07:11,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:07:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 14:07:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2019-12-07 14:07:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 14:07:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2019-12-07 14:07:11,771 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 20 [2019-12-07 14:07:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:11,771 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2019-12-07 14:07:11,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:07:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2019-12-07 14:07:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:07:11,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:11,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:11,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:07:11,974 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1702507591, now seen corresponding path program 1 times [2019-12-07 14:07:11,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:11,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411360872] [2019-12-07 14:07:11,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:12,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:07:12,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:12,112 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:12,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411360872] [2019-12-07 14:07:12,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:12,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:07:12,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893219719] [2019-12-07 14:07:12,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:07:12,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:07:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:07:12,136 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 5 states. [2019-12-07 14:07:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:12,157 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2019-12-07 14:07:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:07:12,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 14:07:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:12,159 INFO L225 Difference]: With dead ends: 104 [2019-12-07 14:07:12,159 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 14:07:12,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:07:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 14:07:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 14:07:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 14:07:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2019-12-07 14:07:12,167 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 22 [2019-12-07 14:07:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:12,167 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2019-12-07 14:07:12,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:07:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2019-12-07 14:07:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:07:12,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:12,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:12,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:07:12,370 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash -503576158, now seen corresponding path program 1 times [2019-12-07 14:07:12,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:12,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445353071] [2019-12-07 14:07:12,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:12,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:07:12,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:12,532 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:12,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-12-07 14:07:12,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445353071] [2019-12-07 14:07:12,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:12,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 14:07:12,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792066625] [2019-12-07 14:07:12,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:07:12,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:07:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:07:12,606 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand 10 states. [2019-12-07 14:07:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:12,663 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2019-12-07 14:07:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:07:12,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 14:07:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:12,665 INFO L225 Difference]: With dead ends: 118 [2019-12-07 14:07:12,665 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 14:07:12,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:07:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 14:07:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-12-07 14:07:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 14:07:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-12-07 14:07:12,673 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 22 [2019-12-07 14:07:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:12,673 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-12-07 14:07:12,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:07:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-12-07 14:07:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 14:07:12,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:12,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:12,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:07:12,876 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:12,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1238127481, now seen corresponding path program 1 times [2019-12-07 14:07:12,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:12,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965617272] [2019-12-07 14:07:12,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:13,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:07:13,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:13,082 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:13,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965617272] [2019-12-07 14:07:13,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:13,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-12-07 14:07:13,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161666009] [2019-12-07 14:07:13,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:07:13,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:13,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:07:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:07:13,159 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 10 states. [2019-12-07 14:07:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:13,377 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2019-12-07 14:07:13,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:07:13,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 14:07:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:13,378 INFO L225 Difference]: With dead ends: 118 [2019-12-07 14:07:13,378 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 14:07:13,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:07:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 14:07:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2019-12-07 14:07:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 14:07:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2019-12-07 14:07:13,384 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 23 [2019-12-07 14:07:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:13,384 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2019-12-07 14:07:13,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:07:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2019-12-07 14:07:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:07:13,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:13,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:13,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:07:13,587 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash 272754043, now seen corresponding path program 1 times [2019-12-07 14:07:13,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:13,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587703129] [2019-12-07 14:07:13,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:13,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:07:13,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:13,797 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-12-07 14:07:13,797 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:13,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:13,798 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:13,798 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:07:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:13,830 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:13,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587703129] [2019-12-07 14:07:13,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:13,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-12-07 14:07:13,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402030384] [2019-12-07 14:07:13,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:07:13,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:07:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:07:13,860 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 6 states. [2019-12-07 14:07:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:13,984 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-12-07 14:07:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:07:13,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 14:07:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:13,986 INFO L225 Difference]: With dead ends: 108 [2019-12-07 14:07:13,986 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 14:07:13,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:07:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 14:07:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-12-07 14:07:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 14:07:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-12-07 14:07:13,991 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 24 [2019-12-07 14:07:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:13,991 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-12-07 14:07:13,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:07:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-12-07 14:07:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:07:13,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:13,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:14,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:07:14,194 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash -232804582, now seen corresponding path program 1 times [2019-12-07 14:07:14,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:14,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431608742] [2019-12-07 14:07:14,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:14,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:07:14,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:14,361 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:14,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431608742] [2019-12-07 14:07:14,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:14,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 14:07:14,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871547922] [2019-12-07 14:07:14,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:07:14,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:07:14,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:07:14,386 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 5 states. [2019-12-07 14:07:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:14,402 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-12-07 14:07:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:07:14,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 14:07:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:14,402 INFO L225 Difference]: With dead ends: 68 [2019-12-07 14:07:14,403 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 14:07:14,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-12-07 14:07:14,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 14:07:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 14:07:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:07:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-12-07 14:07:14,405 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 24 [2019-12-07 14:07:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:14,405 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-12-07 14:07:14,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:07:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-12-07 14:07:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:07:14,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:14,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:14,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:07:14,608 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1514319562, now seen corresponding path program 1 times [2019-12-07 14:07:14,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:14,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920476561] [2019-12-07 14:07:14,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:14,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:07:14,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:14,764 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 14:07:14,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 14:07:14,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:14,781 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 14:07:14,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:14,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:14,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 14:07:14,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:14,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:14,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 14:07:14,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:14,850 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 14:07:14,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:14,850 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 14:07:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:14,956 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:17,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920476561] [2019-12-07 14:07:17,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:17,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-12-07 14:07:17,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301216252] [2019-12-07 14:07:17,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:07:17,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:17,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:07:17,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2019-12-07 14:07:17,231 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 14 states. [2019-12-07 14:07:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:21,758 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-12-07 14:07:21,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:07:21,759 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-12-07 14:07:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:21,760 INFO L225 Difference]: With dead ends: 63 [2019-12-07 14:07:21,760 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 14:07:21,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=98, Invalid=281, Unknown=1, NotChecked=0, Total=380 [2019-12-07 14:07:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 14:07:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 14:07:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 14:07:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-12-07 14:07:21,762 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 28 [2019-12-07 14:07:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:21,763 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-12-07 14:07:21,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:07:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-12-07 14:07:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:07:21,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:21,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:21,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 14:07:21,965 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:07:21,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:21,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1514319563, now seen corresponding path program 1 times [2019-12-07 14:07:21,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:07:21,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214005237] [2019-12-07 14:07:21,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:07:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:22,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 14:07:22,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:22,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:22,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 14:07:22,091 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:22,115 INFO L614 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-12-07 14:07:22,151 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 14:07:22,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 14:07:22,152 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:22,185 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-12-07 14:07:22,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:22,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:22,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:22,187 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-12-07 14:07:22,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:22,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:22,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:22,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:22,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:22,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:22,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:22,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:22,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:22,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:22,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:22,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:24,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:07:24,415 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:24,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:07:24,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:24,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:24,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:07:24,428 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:24,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:24,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-12-07 14:07:24,451 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:24,486 INFO L614 ElimStorePlain]: treesize reduction 57, result has 26.9 percent of original size [2019-12-07 14:07:24,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 14:07:24,489 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:24,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:24,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:24,498 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:11 [2019-12-07 14:07:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:24,591 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:24,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:24,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:24,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:24,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:27,736 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 14:07:27,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:07:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:30,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214005237] [2019-12-07 14:07:30,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:30,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-12-07 14:07:30,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83904359] [2019-12-07 14:07:30,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:07:30,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:07:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:07:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=169, Unknown=2, NotChecked=0, Total=210 [2019-12-07 14:07:30,535 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 15 states. [2019-12-07 14:07:41,239 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 14:08:03,253 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-12-07 14:08:07,321 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 (_ BitVec 32)) (v_ldv_malloc_~size_47 (_ BitVec 32))) (or (not (= (select |c_#valid| v_prenex_4) (_ bv0 1))) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) (select (store |c_#length| v_prenex_4 v_ldv_malloc_~size_47) |c_~#a6~0.base|)))) (exists ((v_probe3_6_~a.base_BEFORE_CALL_8 (_ BitVec 32))) (= (bvadd (select |c_#length| v_probe3_6_~a.base_BEFORE_CALL_8) (_ bv4294967292 32)) (_ bv0 32))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (or (bvule |c_~#a6~0.offset| (bvadd |c_~#a6~0.offset| (_ bv4 32))) (forall ((|v_ldv_malloc_#t~malloc12.base_28| (_ BitVec 32))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_28|) (_ bv0 1)))))) is different from false [2019-12-07 14:08:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:36,390 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-12-07 14:08:36,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:08:36,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-12-07 14:08:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:36,392 INFO L225 Difference]: With dead ends: 62 [2019-12-07 14:08:36,392 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 14:08:36,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=120, Invalid=387, Unknown=3, NotChecked=42, Total=552 [2019-12-07 14:08:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 14:08:36,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 14:08:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 14:08:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-12-07 14:08:36,395 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 28 [2019-12-07 14:08:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:36,395 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-12-07 14:08:36,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:08:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-12-07 14:08:36,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:08:36,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:36,396 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-12-07 14:08:36,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 14:08:36,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:08:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:36,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1727877462, now seen corresponding path program 1 times [2019-12-07 14:08:36,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:08:36,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811268815] [2019-12-07 14:08:36,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:08:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:36,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 14:08:36,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:08:36,757 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 14:08:36,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 14:08:36,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:08:36,773 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 14:08:36,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:08:36,774 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:08:36,774 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 14:08:36,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:08:36,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:08:36,783 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:08:36,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:08:36,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:08:36,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 14:08:36,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 14:08:36,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:08:36,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:08:36,817 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:08:36,817 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 14:08:38,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:08:38,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 14:08:38,872 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:08:38,888 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 14:08:38,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:08:38,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-12-07 14:08:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:08:38,904 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:08:38,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:08:39,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:08:39,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-12-07 14:08:39,054 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:08:39,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:08:39,058 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:08:39,058 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-12-07 14:08:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:08:39,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811268815] [2019-12-07 14:08:39,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:39,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2019-12-07 14:08:39,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999468808] [2019-12-07 14:08:39,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:08:39,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:08:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:08:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2019-12-07 14:08:39,105 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 14 states. [2019-12-07 14:09:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:45,648 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-12-07 14:09:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:09:45,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-12-07 14:09:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:45,649 INFO L225 Difference]: With dead ends: 67 [2019-12-07 14:09:45,649 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 14:09:45,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=96, Invalid=319, Unknown=5, NotChecked=0, Total=420 [2019-12-07 14:09:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 14:09:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-12-07 14:09:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 14:09:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-12-07 14:09:45,652 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2019-12-07 14:09:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:45,653 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-12-07 14:09:45,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:09:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-12-07 14:09:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:09:45,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:45,654 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-12-07 14:09:45,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 14:09:45,856 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:09:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1727877461, now seen corresponding path program 1 times [2019-12-07 14:09:45,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:09:45,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364432699] [2019-12-07 14:09:45,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:09:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:46,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 14:09:46,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:09:46,070 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 14:09:46,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 14:09:46,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,107 INFO L614 ElimStorePlain]: treesize reduction 10, result has 77.8 percent of original size [2019-12-07 14:09:46,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:46,121 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 14:09:46,121 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,157 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-12-07 14:09:46,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:46,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:46,159 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:09:46,159 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-12-07 14:09:46,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:46,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:46,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:46,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:46,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:46,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:46,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:46,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:46,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:46,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:46,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:46,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:46,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:46,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:09:46,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:09:46,228 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:46,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:09:46,234 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,237 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:09:46,238 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:09:46,242 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,245 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:09:46,245 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,273 INFO L614 ElimStorePlain]: treesize reduction 85, result has 15.0 percent of original size [2019-12-07 14:09:46,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:09:46,275 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:46,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:09:46,280 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:193, output treesize:10 [2019-12-07 14:09:48,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:09:48,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:48,328 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-12-07 14:09:48,328 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:48,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,332 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:3 [2019-12-07 14:09:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:48,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:48,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:48,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:48,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-12-07 14:09:48,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:48,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 14:09:48,386 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:48,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:48,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:48,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-12-07 14:09:48,414 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:48,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 14:09:48,429 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:48,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:48,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:48,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-12-07 14:09:48,448 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,547 INFO L614 ElimStorePlain]: treesize reduction 133, result has 39.8 percent of original size [2019-12-07 14:09:48,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:48,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-12-07 14:09:48,569 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,573 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:09:48,573 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:09:48,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:09:48,574 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:48,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:09:48,584 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,610 INFO L614 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-12-07 14:09:48,611 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:09:48,611 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:206, output treesize:9 [2019-12-07 14:09:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:48,627 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:09:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:48,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:48,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:48,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:09:48,954 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-12-07 14:09:48,956 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 14:09:48,958 INFO L430 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_5|], 6=[|v_old(#valid)_BEFORE_CALL_9|]} [2019-12-07 14:09:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:49,022 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 14:09:49,341 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-07 14:09:49,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:09:49,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:49,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:49,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:49,348 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-12-07 14:09:49,353 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-07 14:09:49,356 INFO L430 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_6|], 6=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-12-07 14:09:54,000 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-12-07 14:09:54,004 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2019-12-07 14:09:54,006 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_14], 1=[v_prenex_13, |v_old(#length)_BEFORE_CALL_6|, |v_old(#valid)_BEFORE_CALL_10|]} [2019-12-07 14:09:54,442 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-12-07 14:09:54,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:09:54,586 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 14:09:54,738 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 14:09:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:55,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364432699] [2019-12-07 14:09:55,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:55,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 12 [2019-12-07 14:09:55,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332181503] [2019-12-07 14:09:55,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:09:55,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:09:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:09:55,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=101, Unknown=7, NotChecked=0, Total=156 [2019-12-07 14:09:55,040 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 13 states. [2019-12-07 14:10:11,386 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 14:10:29,695 WARN L192 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-12-07 14:10:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:29,726 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-12-07 14:10:29,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:10:29,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-12-07 14:10:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:29,727 INFO L225 Difference]: With dead ends: 62 [2019-12-07 14:10:29,727 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 14:10:29,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=119, Invalid=213, Unknown=10, NotChecked=0, Total=342 [2019-12-07 14:10:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 14:10:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-07 14:10:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 14:10:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 53 transitions. [2019-12-07 14:10:29,730 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 53 transitions. Word has length 29 [2019-12-07 14:10:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:29,730 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 53 transitions. [2019-12-07 14:10:29,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:10:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2019-12-07 14:10:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:10:29,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:29,731 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-12-07 14:10:29,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 14:10:29,933 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:10:29,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash 764373490, now seen corresponding path program 1 times [2019-12-07 14:10:29,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:10:29,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131938550] [2019-12-07 14:10:29,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:10:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:30,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 14:10:30,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:10:30,142 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 14:10:30,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 14:10:30,142 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:10:30,158 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 14:10:30,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:10:30,159 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:10:30,159 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 14:10:30,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:10:30,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:10:30,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:10:30,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:10:30,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:10:30,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 14:10:30,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 14:10:30,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:10:30,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:10:30,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:10:30,221 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 14:10:30,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 14:10:30,251 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:10:30,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:10:30,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:10:30,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 14:10:34,349 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:10:34,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 53 [2019-12-07 14:10:34,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:10:34,364 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 14:10:34,364 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:10:34,365 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:11 [2019-12-07 14:10:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:34,426 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:10:34,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:10:34,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:10:34,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:34,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-12-07 14:10:34,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:10:34,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:10:34,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:10:34,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:23 [2019-12-07 14:10:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:34,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131938550] [2019-12-07 14:10:34,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:34,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 21 [2019-12-07 14:10:34,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323167530] [2019-12-07 14:10:34,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 14:10:34,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:10:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 14:10:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=377, Unknown=2, NotChecked=0, Total=462 [2019-12-07 14:10:34,783 INFO L87 Difference]: Start difference. First operand 54 states and 53 transitions. Second operand 22 states. [2019-12-07 14:11:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:11:33,742 INFO L93 Difference]: Finished difference Result 53 states and 52 transitions. [2019-12-07 14:11:33,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:11:33,742 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-12-07 14:11:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:11:33,743 INFO L225 Difference]: With dead ends: 53 [2019-12-07 14:11:33,743 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 14:11:33,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=175, Invalid=749, Unknown=6, NotChecked=0, Total=930 [2019-12-07 14:11:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 14:11:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 14:11:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 14:11:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 52 transitions. [2019-12-07 14:11:33,745 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 52 transitions. Word has length 38 [2019-12-07 14:11:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:11:33,746 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 52 transitions. [2019-12-07 14:11:33,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 14:11:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 52 transitions. [2019-12-07 14:11:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:11:33,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:11:33,746 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-12-07 14:11:33,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 14:11:33,948 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:11:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:11:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash 764373491, now seen corresponding path program 1 times [2019-12-07 14:11:33,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:11:33,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547600332] [2019-12-07 14:11:33,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:11:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:11:34,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:11:34,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:11:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:34,134 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:11:34,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 14:11:34,340 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:11:34,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:34,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:11:34,357 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-12-07 14:11:34,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:34,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-12-07 14:11:34,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,476 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:11:34,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:34,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,507 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:11:34,507 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-12-07 14:11:34,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:34,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:36,983 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_prenex_24 (_ BitVec 32))) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_24))) (.cse2 (exists ((v_arrayElimCell_50 (_ BitVec 32))) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_50)))) (.cse1 (not (bvule |c_~#a6~0.offset| (bvadd |c_~#a6~0.offset| (_ bv4 32))))) (.cse3 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_10 (_ BitVec 32))) (or (forall ((v_prenex_25 (_ BitVec 32))) (or (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_prenex_25)) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_25))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_arrayElimCell_49))))))) (and (or .cse0 .cse1 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_10 (_ BitVec 32))) (or (exists ((v_arrayElimCell_49 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_arrayElimCell_49))) (forall ((v_prenex_25 (_ BitVec 32))) (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_prenex_25))))) .cse2) (or .cse1 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_10 (_ BitVec 32))) (or (forall ((v_prenex_25 (_ BitVec 32))) (or (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_prenex_25)) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_25))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_arrayElimCell_49)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_arrayElimCell_49)))))) (or .cse0 .cse1 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_10 (_ BitVec 32))) (or (exists ((v_arrayElimCell_49 (_ BitVec 32))) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_arrayElimCell_49)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_arrayElimCell_49))) (forall ((v_prenex_25 (_ BitVec 32))) (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_10 (_ bv4 32)) v_prenex_25)))))) (or .cse1 .cse3 .cse2) (or .cse1 .cse3))) is different from false [2019-12-07 14:11:37,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:37,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:37,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:37,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:37,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:37,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:37,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,402 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_prenex_26 (_ BitVec 32))) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_26))) (.cse1 (not (bvule |c_~#a6~0.offset| (bvadd |c_~#a6~0.offset| (_ bv4 32))))) (.cse3 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_11 (_ BitVec 32))) (or (exists ((v_arrayElimCell_49 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_arrayElimCell_49))) (forall ((v_prenex_27 (_ BitVec 32))) (or (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_27) (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_prenex_27))))))) (.cse2 (exists ((v_arrayElimCell_50 (_ BitVec 32))) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_50))))) (and (or .cse0 .cse1 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_11 (_ BitVec 32))) (or (exists ((v_arrayElimCell_49 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_arrayElimCell_49))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_arrayElimCell_49)) (forall ((v_prenex_27 (_ BitVec 32))) (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_prenex_27)))))) (or .cse0 .cse1 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_11 (_ BitVec 32))) (or (exists ((v_arrayElimCell_49 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_arrayElimCell_49))) (forall ((v_prenex_27 (_ BitVec 32))) (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_prenex_27))))) .cse2) (or .cse1 .cse3) (or .cse1 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_11 (_ BitVec 32))) (or (exists ((v_arrayElimCell_49 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_arrayElimCell_49))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_arrayElimCell_49)) (forall ((v_prenex_27 (_ BitVec 32))) (or (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_27) (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_11 (_ bv4 32)) v_prenex_27))))))) (or .cse1 .cse3 .cse2))) is different from false [2019-12-07 14:11:39,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:39,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:41,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32))) (or (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49) (exists ((v_prenex_29 (_ BitVec 32))) (and (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_prenex_29) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_29))))))) (.cse2 (exists ((v_prenex_28 (_ BitVec 32))) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_28)))) (.cse0 (not (bvule |c_~#a6~0.offset| (bvadd |c_~#a6~0.offset| (_ bv4 32))))) (.cse1 (forall ((v_arrayElimCell_50 (_ BitVec 32))) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_50)))) (and (or .cse0 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32))) (or (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_arrayElimCell_49)) (exists ((v_prenex_29 (_ BitVec 32))) (and (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_prenex_29) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_29)))))) .cse1 .cse2) (or .cse3 .cse0) (or .cse0 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32))) (or (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_arrayElimCell_49)) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_arrayElimCell_49) (exists ((v_prenex_29 (_ BitVec 32))) (and (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_prenex_29) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_29)))) (exists ((v_prenex_29 (_ BitVec 32))) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_prenex_29))))) (or .cse3 .cse0 .cse2) (or .cse0 (forall ((v_probe3_6_~a.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32))) (or (not (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_arrayElimCell_49)) (exists ((v_prenex_29 (_ BitVec 32))) (and (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_prenex_29) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) v_prenex_29)))) (exists ((v_prenex_29 (_ BitVec 32))) (bvule (bvadd v_probe3_6_~a.offset_BEFORE_CALL_12 (_ bv4 32)) v_prenex_29)))) .cse1))) is different from false [2019-12-07 14:11:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:41,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547600332] [2019-12-07 14:11:41,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:11:41,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-12-07 14:11:41,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231865488] [2019-12-07 14:11:41,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:11:41,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:11:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:11:41,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:11:41,911 INFO L87 Difference]: Start difference. First operand 53 states and 52 transitions. Second operand 14 states. [2019-12-07 14:11:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:11:42,377 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2019-12-07 14:11:42,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:11:42,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-12-07 14:11:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:11:42,379 INFO L225 Difference]: With dead ends: 52 [2019-12-07 14:11:42,379 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 14:11:42,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:11:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 14:11:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 14:11:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:11:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2019-12-07 14:11:42,382 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 38 [2019-12-07 14:11:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:11:42,382 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2019-12-07 14:11:42,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:11:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2019-12-07 14:11:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:11:42,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:11:42,383 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] [2019-12-07 14:11:42,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 14:11:42,584 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:11:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:11:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2074225181, now seen corresponding path program 1 times [2019-12-07 14:11:42,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:11:42,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956332960] [2019-12-07 14:11:42,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:11:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:11:42,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:11:42,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:11:42,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:11:42,824 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:42,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:42,826 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:11:42,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 14:11:42,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 14:11:42,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:42,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:42,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:11:42,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 14:11:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:42,878 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:11:42,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 14:11:42,952 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 14:11:42,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:42,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 14:11:42,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 14:11:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:42,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956332960] [2019-12-07 14:11:42,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:11:42,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2019-12-07 14:11:42,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047448293] [2019-12-07 14:11:42,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:11:42,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:11:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:11:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:11:42,980 INFO L87 Difference]: Start difference. First operand 52 states and 51 transitions. Second operand 11 states. [2019-12-07 14:11:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:11:43,287 INFO L93 Difference]: Finished difference Result 51 states and 50 transitions. [2019-12-07 14:11:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:11:43,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-07 14:11:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:11:43,288 INFO L225 Difference]: With dead ends: 51 [2019-12-07 14:11:43,288 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 14:11:43,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:11:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 14:11:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 14:11:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 14:11:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 50 transitions. [2019-12-07 14:11:43,289 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 50 transitions. Word has length 39 [2019-12-07 14:11:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:11:43,290 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 50 transitions. [2019-12-07 14:11:43,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:11:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 50 transitions. [2019-12-07 14:11:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:11:43,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:11:43,290 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-12-07 14:11:43,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 14:11:43,491 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:11:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:11:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 123529298, now seen corresponding path program 1 times [2019-12-07 14:11:43,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:11:43,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606845654] [2019-12-07 14:11:43,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:11:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:11:43,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 14:11:43,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:11:43,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:11:43,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:43,758 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:43,758 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:11:43,759 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 14:11:43,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 14:11:43,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:43,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:43,891 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:11:43,891 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-12-07 14:11:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:43,921 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:11:44,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 14:11:44,210 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:11:44,249 INFO L614 ElimStorePlain]: treesize reduction 13, result has 53.6 percent of original size [2019-12-07 14:11:44,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:11:44,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:15 [2019-12-07 14:11:44,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:44,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:44,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:44,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:44,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:44,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:44,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:44,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:44,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606845654] [2019-12-07 14:11:44,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:11:44,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 11] imperfect sequences [] total 23 [2019-12-07 14:11:44,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898207316] [2019-12-07 14:11:44,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 14:11:44,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:11:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 14:11:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2019-12-07 14:11:44,477 INFO L87 Difference]: Start difference. First operand 51 states and 50 transitions. Second operand 24 states. [2019-12-07 14:11:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:11:45,633 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2019-12-07 14:11:45,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:11:45,634 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2019-12-07 14:11:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:11:45,634 INFO L225 Difference]: With dead ends: 50 [2019-12-07 14:11:45,634 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 14:11:45,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 14:11:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 14:11:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 14:11:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 14:11:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2019-12-07 14:11:45,636 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 40 [2019-12-07 14:11:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:11:45,637 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2019-12-07 14:11:45,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 14:11:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2019-12-07 14:11:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:11:45,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:11:45,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:11:45,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 14:11:45,839 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:11:45,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:11:45,839 INFO L82 PathProgramCache]: Analyzing trace with hash -465558587, now seen corresponding path program 1 times [2019-12-07 14:11:45,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:11:45,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435532798] [2019-12-07 14:11:45,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/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-12-07 14:11:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:11:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:11:46,107 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 14:11:46,107 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:11:46,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 14:11:46,335 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 11bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-12-07 14:11:46,336 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 6bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2019-12-07 14:11:46,336 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 10bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2019-12-07 14:11:46,336 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 5bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-12-07 14:11:46,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:11:46 BoogieIcfgContainer [2019-12-07 14:11:46,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:11:46,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:11:46,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:11:46,347 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:11:46,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:07:09" (3/4) ... [2019-12-07 14:11:46,349 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:11:46,354 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 5bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-12-07 14:11:46,354 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 10bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2019-12-07 14:11:46,354 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 6bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2019-12-07 14:11:46,354 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 11bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-12-07 14:11:46,381 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c759b646-0e00-4726-a7d1-9deec83e1cce/bin/uautomizer/witness.graphml [2019-12-07 14:11:46,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:11:46,382 INFO L168 Benchmark]: Toolchain (without parser) took 277966.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 947.0 MB in the beginning and 933.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 262.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:11:46,382 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:11:46,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -129.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:11:46,383 INFO L168 Benchmark]: Boogie Preprocessor took 64.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:11:46,383 INFO L168 Benchmark]: RCFGBuilder took 928.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 125.4 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:11:46,383 INFO L168 Benchmark]: TraceAbstraction took 276497.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 951.2 MB in the beginning and 942.7 MB in the end (delta: 8.5 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:11:46,383 INFO L168 Benchmark]: Witness Printer took 34.62 ms. Allocated memory is still 1.3 GB. Free memory was 942.7 MB in the beginning and 933.9 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:11:46,385 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -129.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 928.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 125.4 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 276497.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 951.2 MB in the beginning and 942.7 MB in the end (delta: 8.5 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.62 ms. Allocated memory is still 1.3 GB. Free memory was 942.7 MB in the beginning and 933.9 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 11bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 6bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 10bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 5bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 5bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 10bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 6bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 11bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 782]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L784] struct A a6; VAL [\old(a6)=null, \old(a6)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, a6={3:0}, ldv_global_msg_list={7:0}] [L793] CALL entry_point() VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L786] CALL, EXPR probe3_6(&a6) VAL [a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}] [L764] int ret = - -3; VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, ret=3] [L765] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={3:0}, ldv_global_msg_list={7:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [\old(size)=4, \result={1:0}, a6={3:0}, ldv_global_msg_list={7:0}, malloc(size)={1:0}, size=4] [L765] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, ldv_malloc(sizeof(int))={1:0}, ret=3] [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, p={1:0}, ret=3] [L768] CALL, EXPR f6() VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L758] return __VERIFIER_nondet_int(); [L768] RET, EXPR f6() VAL [a={3:0}, a={3:0}, a6={3:0}, f6()=0, ldv_global_msg_list={7:0}, p={1:0}, ret=3] [L768] ret = f6() [L769] COND FALSE !(ret<0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, p={1:0}, ret=0] [L771] CALL, EXPR g6() VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L761] return __VERIFIER_nondet_int(); [L771] RET, EXPR g6() VAL [a={3:0}, a={3:0}, a6={3:0}, g6()=0, ldv_global_msg_list={7:0}, p={1:0}, ret=0] [L771] ret = g6() [L772] COND FALSE !(ret<0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, p={1:0}, ret=0] [L774] a->p = p VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, p={1:0}, ret=0] [L775] free(p) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, p={1:0}, ret=0] [L775] free(p) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, p={1:0}, ret=0] [L775] free(p) [L776] return 0; VAL [\result=0, a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}, p={1:0}, ret=0] [L786] RET, EXPR probe3_6(&a6) VAL [a6={3:0}, ldv_global_msg_list={7:0}, probe3_6(&a6)=0] [L786] int ret = probe3_6(&a6); [L787] COND TRUE ret==0 VAL [a6={3:0}, ldv_global_msg_list={7:0}, ret=0] [L788] CALL disconnect_6(&a6) VAL [a={3:0}, a6={3:0}, ldv_global_msg_list={7:0}] [L782] EXPR a->p VAL [a={3:0}, a={3:0}, a->p={1:0}, a6={3:0}, ldv_global_msg_list={7:0}] [L782] free(a->p) VAL [a={3:0}, a={3:0}, a->p={1:0}, a6={3:0}, ldv_global_msg_list={7:0}] [L782] free(a->p) VAL [a={3:0}, a={3:0}, a->p={1:0}, a6={3:0}, ldv_global_msg_list={7:0}] [L782] free(a->p) VAL [a={3:0}, a={3:0}, a->p={1:0}, a6={3:0}, ldv_global_msg_list={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 51 procedures, 379 locations, 86 error locations. Result: UNSAFE, OverallTime: 276.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 233.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 828 SDtfs, 1491 SDslu, 2459 SDs, 0 SdLazy, 1982 SolverSat, 465 SolverUnsat, 95 SolverUnknown, 0 SolverNotchecked, 194.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 941 GetRequests, 671 SyntacticMatches, 59 SemanticMatches, 211 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 71.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 93 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 36.9s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 856 ConstructedInterpolants, 140 QuantifiedInterpolants, 235702 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1908 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 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 incorrect! Received shutdown request...