./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.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_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 9988836ddee06b99001d03a87a3e72125eac1288 ............................................................................................................................ 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_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 9988836ddee06b99001d03a87a3e72125eac1288 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:32:52,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:32:52,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:32:52,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:32:52,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:32:52,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:32:52,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:32:52,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:32:52,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:32:52,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:32:52,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:32:52,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:32:52,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:32:52,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:32:52,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:32:52,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:32:52,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:32:52,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:32:52,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:32:52,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:32:52,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:32:52,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:32:52,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:32:52,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:32:52,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:32:52,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:32:52,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:32:52,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:32:52,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:32:52,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:32:52,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:32:52,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:32:52,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:32:52,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:32:52,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:32:52,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:32:52,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:32:52,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:32:52,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:32:52,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:32:52,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:32:52,111 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 12:32:52,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:32:52,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:32:52,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:32:52,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:32:52,121 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:32:52,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:32:52,122 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:32:52,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:32:52,123 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:32:52,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:32:52,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:32:52,123 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:32:52,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:32:52,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:32:52,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:32:52,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:32:52,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:32:52,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:32:52,124 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:32:52,124 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_488dc419-4a41-4a26-99c0-d5c34b400563/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 -> 9988836ddee06b99001d03a87a3e72125eac1288 [2019-12-07 12:32:52,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:32:52,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:32:52,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:32:52,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:32:52,238 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:32:52,239 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i [2019-12-07 12:32:52,288 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data/ec86a4f3d/bbcaab9d545f4d3ca8c9775e404c0285/FLAG4e19ef5c0 [2019-12-07 12:32:52,728 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:32:52,729 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i [2019-12-07 12:32:52,739 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data/ec86a4f3d/bbcaab9d545f4d3ca8c9775e404c0285/FLAG4e19ef5c0 [2019-12-07 12:32:53,062 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data/ec86a4f3d/bbcaab9d545f4d3ca8c9775e404c0285 [2019-12-07 12:32:53,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:32:53,067 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 12:32:53,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:32:53,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:32:53,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:32:53,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:53" (1/1) ... [2019-12-07 12:32:53,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acb3a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53, skipping insertion in model container [2019-12-07 12:32:53,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:53" (1/1) ... [2019-12-07 12:32:53,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:32:53,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:32:53,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:32:53,390 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 12:32:53,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2753dbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53, skipping insertion in model container [2019-12-07 12:32:53,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:32:53,391 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 12:32:53,393 INFO L168 Benchmark]: Toolchain (without parser) took 326.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:53,393 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:53,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:53,395 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 18.3 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 12:32:54,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:32:54,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:32:54,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:32:54,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:32:54,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:32:54,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:32:54,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:32:54,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:32:54,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:32:54,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:32:54,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:32:54,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:32:54,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:32:54,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:32:54,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:32:54,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:32:54,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:32:54,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:32:54,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:32:54,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:32:54,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:32:54,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:32:54,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:32:54,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:32:54,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:32:54,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:32:54,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:32:54,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:32:54,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:32:54,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:32:54,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:32:54,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:32:54,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:32:54,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:32:54,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:32:54,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:32:54,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:32:54,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:32:54,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:32:54,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:32:54,519 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 12:32:54,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:32:54,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:32:54,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:32:54,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:32:54,530 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:32:54,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:32:54,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:32:54,532 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:32:54,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:32:54,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:32:54,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:32:54,532 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:32:54,532 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:32:54,532 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:32:54,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:32:54,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:32:54,533 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:32:54,533 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:32:54,533 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:32:54,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:32:54,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:32:54,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:32:54,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:32:54,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:32:54,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:32:54,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:32:54,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:32:54,534 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 12:32:54,535 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:32:54,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:32:54,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:32:54,535 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_488dc419-4a41-4a26-99c0-d5c34b400563/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 -> 9988836ddee06b99001d03a87a3e72125eac1288 [2019-12-07 12:32:54,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:32:54,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:32:54,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:32:54,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:32:54,708 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:32:54,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i [2019-12-07 12:32:54,746 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data/2d2883f8c/00e6238183c344f291d7265b3eacfef1/FLAG53bdbabb1 [2019-12-07 12:32:55,246 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:32:55,246 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i [2019-12-07 12:32:55,260 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data/2d2883f8c/00e6238183c344f291d7265b3eacfef1/FLAG53bdbabb1 [2019-12-07 12:32:55,272 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/bin/uautomizer/data/2d2883f8c/00e6238183c344f291d7265b3eacfef1 [2019-12-07 12:32:55,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:32:55,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 12:32:55,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:32:55,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:32:55,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:32:55,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,280 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 12:32:55, skipping insertion in model container [2019-12-07 12:32:55,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:32:55,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:32:55,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:32:55,595 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 12:32:55,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:32:55,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:32:55,637 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:32:55,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:32:55,725 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:32:55,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55 WrapperNode [2019-12-07 12:32:55,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:32:55,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:32:55,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:32:55,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:32:55,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (1/1) ... [2019-12-07 12:32:55,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:32:55,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:32:55,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:32:55,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:32:55,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 12:32:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 12:32:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 12:32:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 12:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 12:32:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 12:32:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 12:32:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 12:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 12:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 12:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 12:32:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 12:32:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 12:32:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 12:32:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 12:32:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 12:32:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 12:32:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 12:32:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 12:32:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2019-12-07 12:32:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 12:32:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 12:32:56,190 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:32:56,430 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:32:56,689 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:32:56,689 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 12:32:56,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:56 BoogieIcfgContainer [2019-12-07 12:32:56,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:32:56,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:32:56,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:32:56,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:32:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:32:55" (1/3) ... [2019-12-07 12:32:56,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a87a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:56, skipping insertion in model container [2019-12-07 12:32:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:55" (2/3) ... [2019-12-07 12:32:56,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a87a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:56, skipping insertion in model container [2019-12-07 12:32:56,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:56" (3/3) ... [2019-12-07 12:32:56,696 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3.i [2019-12-07 12:32:56,702 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:32:56,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 78 error locations. [2019-12-07 12:32:56,715 INFO L249 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2019-12-07 12:32:56,728 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:32:56,728 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:32:56,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:32:56,728 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:32:56,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:32:56,729 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:32:56,729 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:32:56,729 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:32:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-12-07 12:32:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:32:56,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:56,747 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 12:32:56,748 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:32:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash 24886788, now seen corresponding path program 1 times [2019-12-07 12:32:56,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:56,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119640922] [2019-12-07 12:32:56,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:32:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:56,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:32:56,895 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:56,930 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 12:32:56,930 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:32:56,996 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 12:32:56,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119640922] [2019-12-07 12:32:56,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:56,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 12:32:56,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577677884] [2019-12-07 12:32:57,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:57,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:32:57,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:57,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:57,012 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 5 states. [2019-12-07 12:32:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:57,071 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-12-07 12:32:57,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:32:57,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 12:32:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:57,081 INFO L225 Difference]: With dead ends: 76 [2019-12-07 12:32:57,081 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 12:32:57,082 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 12:32:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 12:32:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-12-07 12:32:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 12:32:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-12-07 12:32:57,113 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 20 [2019-12-07 12:32:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:57,113 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-12-07 12:32:57,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-12-07 12:32:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:32:57,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:57,114 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 12:32:57,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:32:57,315 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:32:57,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:57,316 INFO L82 PathProgramCache]: Analyzing trace with hash -171626717, now seen corresponding path program 1 times [2019-12-07 12:32:57,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:57,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74778866] [2019-12-07 12:32:57,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:32:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:57,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:32:57,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:57,493 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 12:32:57,493 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 12:32:57,494 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:32:57,517 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 12:32:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:32:57,524 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 12:32:57,524 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 12:32:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:32:57,543 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 12:32:57,544 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:32:57,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:32:57,546 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:32:57,546 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 12:32:57,554 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 12:32:57,554 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:32:57,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:57,607 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 12:32:57,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:32:57,613 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:32:57,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:32:57,614 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-12-07 12:32:57,631 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 12:32:57,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74778866] [2019-12-07 12:32:57,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:57,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 12:32:57,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084046117] [2019-12-07 12:32:57,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:57,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:32:57,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:57,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:57,635 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-12-07 12:32:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:57,768 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-12-07 12:32:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:32:57,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 12:32:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:57,769 INFO L225 Difference]: With dead ends: 92 [2019-12-07 12:32:57,770 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 12:32:57,770 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 12:32:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 12:32:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-12-07 12:32:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 12:32:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2019-12-07 12:32:57,778 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 20 [2019-12-07 12:32:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:57,778 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2019-12-07 12:32:57,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2019-12-07 12:32:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:32:57,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:57,780 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 12:32:57,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:32:57,981 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:32:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash -171626716, now seen corresponding path program 1 times [2019-12-07 12:32:57,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:57,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987506742] [2019-12-07 12:32:57,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:32:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:58,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:32:58,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:58,129 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:32:58,129 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 12:32:58,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:32:58,148 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:32:58,149 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 12:32:58,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 12:32:58,160 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 12:32:58,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:32:58,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:32:58,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:32:58,165 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-12-07 12:32:58,176 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 12:32:58,176 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:32:58,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:32:58,291 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 12:32:58,291 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 12:32:58,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:32:58,315 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 12:32:58,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2019-12-07 12:32:58,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 12:32:58,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987506742] [2019-12-07 12:32:58,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:58,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:32:58,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064838043] [2019-12-07 12:32:58,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:32:58,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:32:58,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:32:58,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:32:58,363 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand 6 states. [2019-12-07 12:32:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:58,488 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-12-07 12:32:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:32:58,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 12:32:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:58,490 INFO L225 Difference]: With dead ends: 110 [2019-12-07 12:32:58,490 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 12:32:58,490 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 12:32:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 12:32:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2019-12-07 12:32:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 12:32:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2019-12-07 12:32:58,497 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 20 [2019-12-07 12:32:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:58,498 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-12-07 12:32:58,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:32:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2019-12-07 12:32:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:32:58,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:58,498 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 12:32:58,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:32:58,700 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:32:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2076107592, now seen corresponding path program 1 times [2019-12-07 12:32:58,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:58,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565607285] [2019-12-07 12:32:58,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:32:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:58,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:32:58,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:58,824 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 12:32:58,824 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:32:58,846 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 12:32:58,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565607285] [2019-12-07 12:32:58,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:58,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:32:58,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824594032] [2019-12-07 12:32:58,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:58,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:32:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:58,847 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 5 states. [2019-12-07 12:32:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:58,865 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-12-07 12:32:58,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:32:58,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 12:32:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:58,867 INFO L225 Difference]: With dead ends: 89 [2019-12-07 12:32:58,867 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 12:32:58,868 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 12:32:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 12:32:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-07 12:32:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 12:32:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2019-12-07 12:32:58,876 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 22 [2019-12-07 12:32:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:58,876 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2019-12-07 12:32:58,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2019-12-07 12:32:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:32:58,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:58,877 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 12:32:59,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:32:59,079 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:32:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:59,080 INFO L82 PathProgramCache]: Analyzing trace with hash -65173633, now seen corresponding path program 1 times [2019-12-07 12:32:59,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:59,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893219719] [2019-12-07 12:32:59,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:32:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:59,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:32:59,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:59,247 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 12:32:59,247 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:32:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:59,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893219719] [2019-12-07 12:32:59,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:59,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-12-07 12:32:59,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599221330] [2019-12-07 12:32:59,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:32:59,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:32:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:32:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:32:59,319 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 10 states. [2019-12-07 12:32:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:59,571 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-12-07 12:32:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:32:59,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 12:32:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:59,573 INFO L225 Difference]: With dead ends: 95 [2019-12-07 12:32:59,573 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 12:32:59,573 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 12:32:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 12:32:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-12-07 12:32:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 12:32:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2019-12-07 12:32:59,580 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 23 [2019-12-07 12:32:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:59,580 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2019-12-07 12:32:59,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:32:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2019-12-07 12:32:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:32:59,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:59,581 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 12:32:59,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:32:59,783 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:32:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2020382166, now seen corresponding path program 1 times [2019-12-07 12:32:59,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:59,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289420166] [2019-12-07 12:32:59,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:32:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:59,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:32:59,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:59,900 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 12:32:59,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:32:59,901 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:32:59,902 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:32:59,902 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:32:59,929 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 12:32:59,929 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:32:59,957 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 12:32:59,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289420166] [2019-12-07 12:32:59,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:59,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-12-07 12:32:59,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056495301] [2019-12-07 12:32:59,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:32:59,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:32:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:32:59,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:32:59,958 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 6 states. [2019-12-07 12:33:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:00,068 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-12-07 12:33:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:33:00,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 12:33:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:00,069 INFO L225 Difference]: With dead ends: 91 [2019-12-07 12:33:00,069 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 12:33:00,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:33:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 12:33:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-12-07 12:33:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 12:33:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2019-12-07 12:33:00,074 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 24 [2019-12-07 12:33:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:00,074 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2019-12-07 12:33:00,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:33:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2019-12-07 12:33:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:33:00,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:00,075 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 12:33:00,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:33:00,276 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:33:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:00,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1769026505, now seen corresponding path program 1 times [2019-12-07 12:33:00,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:00,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860096633] [2019-12-07 12:33:00,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:33:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:00,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:33:00,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:00,401 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 12:33:00,401 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:00,425 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 12:33:00,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860096633] [2019-12-07 12:33:00,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:00,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 12:33:00,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880927743] [2019-12-07 12:33:00,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:33:00,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:00,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:33:00,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:33:00,427 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 5 states. [2019-12-07 12:33:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:00,440 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-12-07 12:33:00,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:33:00,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 12:33:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:00,442 INFO L225 Difference]: With dead ends: 62 [2019-12-07 12:33:00,442 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 12:33:00,442 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 12:33:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 12:33:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-07 12:33:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 12:33:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-12-07 12:33:00,446 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 24 [2019-12-07 12:33:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-12-07 12:33:00,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:33:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-12-07 12:33:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:33:00,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:00,448 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 12:33:00,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 12:33:00,650 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:33:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:00,650 INFO L82 PathProgramCache]: Analyzing trace with hash -292940866, now seen corresponding path program 1 times [2019-12-07 12:33:00,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:00,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788898313] [2019-12-07 12:33:00,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:33:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:00,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:33:00,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:00,816 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 12:33:00,816 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 12:33:00,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:33:00,835 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 12:33:00,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:00,836 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 12:33:00,836 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 12:33:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:00,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:33:00,909 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 12:33:00,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:33:00,923 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 12:33:00,924 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 12:33:00,924 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 12:33:01,023 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 12:33:01,023 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:03,312 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 12:33:03,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788898313] [2019-12-07 12:33:03,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:03,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-12-07 12:33:03,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385351907] [2019-12-07 12:33:03,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:33:03,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:03,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:33:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2019-12-07 12:33:03,314 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 14 states. [2019-12-07 12:33:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:10,051 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-12-07 12:33:10,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:33:10,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-12-07 12:33:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:10,053 INFO L225 Difference]: With dead ends: 62 [2019-12-07 12:33:10,053 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:33:10,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=98, Invalid=281, Unknown=1, NotChecked=0, Total=380 [2019-12-07 12:33:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:33:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2019-12-07 12:33:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 12:33:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-12-07 12:33:10,056 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2019-12-07 12:33:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:10,056 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-12-07 12:33:10,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:33:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-12-07 12:33:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:33:10,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:10,057 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 12:33:10,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 12:33:10,258 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:33:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:10,258 INFO L82 PathProgramCache]: Analyzing trace with hash -292940865, now seen corresponding path program 1 times [2019-12-07 12:33:10,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:10,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888021334] [2019-12-07 12:33:10,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:33:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:10,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:33:10,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:10,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:33:10,382 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 12:33:10,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:33:10,405 INFO L614 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-12-07 12:33:10,437 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 12:33:10,437 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 12:33:10,438 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:33:10,470 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-12-07 12:33:10,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:10,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:10,471 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 12:33:10,471 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-12-07 12:33:10,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:10,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:10,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:10,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:10,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:10,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:10,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:10,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:10,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:10,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:10,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:10,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:12,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:33:12,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:33:12,724 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 12:33:12,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:33:12,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:33:12,736 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 12:33:12,736 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:33:12,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:33:12,759 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 18 treesize of output 36 [2019-12-07 12:33:12,760 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:33:12,822 INFO L614 ElimStorePlain]: treesize reduction 57, result has 26.9 percent of original size [2019-12-07 12:33:12,825 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 12:33:12,825 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:33:12,833 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:33:12,833 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 12:33:12,833 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:11 [2019-12-07 12:33:12,935 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 12:33:12,935 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:13,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:13,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:13,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:13,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:16,326 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 12:33:16,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:33:16,552 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-07 12:33:16,887 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 12:33:16,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888021334] [2019-12-07 12:33:16,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:16,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-12-07 12:33:16,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145350846] [2019-12-07 12:33:16,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:33:16,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:33:16,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=170, Unknown=2, NotChecked=0, Total=210 [2019-12-07 12:33:16,888 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 15 states. [2019-12-07 12:33:31,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_probe1_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_29| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32))) (let ((.cse0 (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (exists ((v_prenex_3 (_ BitVec 32)) (v_ldv_malloc_~size_41 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_3) (_ bv0 1)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_3 v_ldv_malloc_~size_41) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_29|) (_ bv0 1))) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_29| ldv_malloc_~size) v_probe1_6_~a.base_BEFORE_CALL_12)) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0))))) (= |c_~#a6~0.offset| (_ 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|))) (forall ((v_probe1_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse1 (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (bvule .cse1 (select |c_#length| v_probe1_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_3 (_ BitVec 32)) (v_ldv_malloc_~size_41 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_3) (_ bv0 1)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_3 v_ldv_malloc_~size_41) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse1))))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= |c_~#a6~0.base| |~#ldv_global_msg_list~0.base|) (= (bvadd (select |c_#length| |~#ldv_global_msg_list~0.base|) (_ bv4294967288 32)) (_ bv0 32))) (= (bvadd (select |c_#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1)) (or (= (_ bv0 1) (select |c_#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|) (= |c_~#a6~0.base| (_ bv0 32))))) (= (_ bv1 1) (select |c_#valid| |c_~#a6~0.base|)) (= (_ bv4 32) (select |c_#length| |c_~#a6~0.base|)) (exists ((|v_ldv_malloc_#t~malloc12.base_28| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_28|) (_ bv0 1)))) is different from false [2019-12-07 12:33:43,717 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 12 [2019-12-07 12:34:12,327 WARN L192 SmtUtils]: Spent 14.16 s on a formula simplification. DAG size of input: 45 DAG size of output: 21 [2019-12-07 12:35:31,317 WARN L192 SmtUtils]: Spent 18.37 s on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-12-07 12:36:07,760 WARN L192 SmtUtils]: Spent 19.15 s on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-12-07 12:36:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:36:32,864 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-12-07 12:36:32,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:36:32,865 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-12-07 12:36:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:36:32,866 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:36:32,866 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 12:36:32,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 116.7s TimeCoverageRelationStatistics Valid=129, Invalid=452, Unknown=23, NotChecked=46, Total=650 [2019-12-07 12:36:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 12:36:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 12:36:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 12:36:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-12-07 12:36:32,869 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2019-12-07 12:36:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:36:32,869 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-12-07 12:36:32,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:36:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-12-07 12:36:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:36:32,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:36:32,870 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 12:36:33,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 12:36:33,071 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:36:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:36:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2144040275, now seen corresponding path program 1 times [2019-12-07 12:36:33,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:36:33,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876495555] [2019-12-07 12:36:33,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:36:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:36:33,200 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 12:36:33,202 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:36:33,236 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 12:36:33,237 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 12:36:33,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:36:33,255 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 12:36:33,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:36:33,256 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 12:36:33,256 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 12:36:33,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:36:33,270 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 12:36:33,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:36:33,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:36:33,272 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:36:33,272 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 12:36:33,308 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 12:36:33,309 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:36:33,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:36:33,310 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 12:36:33,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 12:36:35,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:36:35,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 12:36:35,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:36:35,386 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 12:36:35,386 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 12:36:35,386 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 12:36:35,404 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 12:36:35,404 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:36:35,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:36:35,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:36:35,566 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 12:36:35,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:36:35,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:36:35,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:36:35,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-12-07 12:36:35,619 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 12:36:35,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876495555] [2019-12-07 12:36:35,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:36:35,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2019-12-07 12:36:35,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821270428] [2019-12-07 12:36:35,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:36:35,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:36:35,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:36:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2019-12-07 12:36:35,621 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 14 states. [2019-12-07 12:37:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:37:50,187 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-12-07 12:37:50,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:37:50,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-12-07 12:37:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:37:50,188 INFO L225 Difference]: With dead ends: 59 [2019-12-07 12:37:50,188 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 12:37:50,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=96, Invalid=319, Unknown=5, NotChecked=0, Total=420 [2019-12-07 12:37:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 12:37:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-12-07 12:37:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 12:37:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-12-07 12:37:50,191 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 29 [2019-12-07 12:37:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:37:50,191 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-12-07 12:37:50,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:37:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-12-07 12:37:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:37:50,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:37:50,192 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 12:37:50,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 12:37:50,393 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:37:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:37:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2144040276, now seen corresponding path program 1 times [2019-12-07 12:37:50,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:37:50,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62307714] [2019-12-07 12:37:50,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:37:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:37:50,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 12:37:50,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:37:50,503 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:50,503 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 12:37:50,503 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,528 INFO L614 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-12-07 12:37:50,563 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 12:37:50,563 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 12:37:50,563 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,594 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-12-07 12:37:50,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:50,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:50,595 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 12:37:50,596 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-12-07 12:37:50,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:50,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:50,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:50,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:50,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:50,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:50,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:50,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:50,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:50,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:50,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:50,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:50,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:50,660 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 12:37:50,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,665 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 12:37:50,665 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:50,672 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 12:37:50,672 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,675 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:37:50,675 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,679 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 12:37:50,679 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,682 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:37:50,682 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,707 INFO L614 ElimStorePlain]: treesize reduction 85, result has 15.0 percent of original size [2019-12-07 12:37:50,709 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 12:37:50,710 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:50,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:50,714 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 12:37:50,714 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:193, output treesize:10 [2019-12-07 12:37:52,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 12:37:52,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:52,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:52,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, 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 12:37:52,758 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:52,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:52,762 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 12:37:52,762 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:3 [2019-12-07 12:37:52,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:52,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:52,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:52,807 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 12:37:52,808 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:52,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:52,834 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 12:37:52,835 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:52,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,847 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 12:37:52,848 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:52,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,873 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:52,873 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 12:37:52,874 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:52,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,885 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 12:37:52,886 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:52,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:52,896 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 12:37:52,896 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:52,996 INFO L614 ElimStorePlain]: treesize reduction 129, result has 40.6 percent of original size [2019-12-07 12:37:53,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:53,017 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 12:37:53,017 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:53,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:37:53,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:37:53,023 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 12:37:53,023 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:53,030 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:53,030 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 12:37:53,031 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:53,057 INFO L614 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-12-07 12:37:53,057 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 12:37:53,058 INFO L239 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:245, output treesize:9 [2019-12-07 12:37:53,076 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 12:37:53,076 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:37:53,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-12-07 12:37:53,438 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 12:37:53,440 INFO L430 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_5|], 6=[|v_old(#valid)_BEFORE_CALL_9|]} [2019-12-07 12:37:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,495 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 12:37:53,848 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-07 12:37:53,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 12:37:53,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,854 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-12-07 12:37:53,859 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-07 12:37:53,861 INFO L430 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_6|], 6=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-12-07 12:37:57,539 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2019-12-07 12:37:57,541 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 12:37:57,543 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_10|], 1=[|v_old(#length)_BEFORE_CALL_6|]} [2019-12-07 12:37:58,001 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-12-07 12:37:58,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:58,005 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:37:58,007 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13, |v_old(#valid)_BEFORE_CALL_10|], 1=[v_prenex_14, |v_old(#length)_BEFORE_CALL_6|]} [2019-12-07 12:37:58,751 WARN L192 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-12-07 12:37:58,779 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 224 [2019-12-07 12:38:03,926 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 6956 disjunctions. This might take some time... [2019-12-07 12:38:03,947 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 5 disjunctions. [2019-12-07 12:38:03,951 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13, v_prenex_19, |v_old(#valid)_BEFORE_CALL_10|], 1=[v_prenex_14, |v_old(#length)_BEFORE_CALL_6|, v_prenex_20]} [2019-12-07 12:38:03,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_prenex_27 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_27)))) (.cse1 (forall ((v_prenex_26 (_ BitVec 32))) (not (= (select |c_#valid| v_prenex_26) (_ bv0 1))))) (.cse3 (forall ((|v_old(#length)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 32))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 32) (_ BitVec 1)))) (exists ((v_prenex_11 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_prenex_12)) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) (select (store |v_old(#length)_BEFORE_CALL_6| v_prenex_12 v_prenex_11) |c_~#a6~0.base|))))))) (.cse2 (bvule |c_~#a6~0.offset| (bvadd |c_~#a6~0.offset| (_ bv4 32)))) (.cse4 (forall ((|v_ldv_malloc_#t~malloc12.base_47| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32))) (or (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_47| ldv_malloc_~size) |c_~#a6~0.base|)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_47|) (_ bv0 1)))))) (.cse5 (exists ((v_ldv_malloc_~size_58 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) (select (store |c_old(#length)| v_prenex_9 v_ldv_malloc_~size_58) |c_~#a6~0.base|))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_9)))))) (and (or (exists ((|v_ldv_malloc_#t~malloc12.base_46| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_46|) (_ bv0 1))) (forall ((v_prenex_24 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (or (not (= (select |c_#valid| v_prenex_25) (_ bv0 1))) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) (select (store |c_#length| v_prenex_25 v_prenex_24) |c_~#a6~0.base|)))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1)))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_13 v_prenex_16)) (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) (select (store v_prenex_14 v_prenex_16 v_prenex_15) |c_~#a6~0.base|))))))) (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse0 .cse5 .cse1) (or .cse3 (not .cse2) .cse4 .cse5) (or (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 32)))) (exists ((v_prenex_22 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32))) (and (not (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) (select (store v_prenex_20 v_prenex_23 v_prenex_22) |c_~#a6~0.base|))) (= (_ bv0 1) (select v_prenex_19 v_prenex_23))))) (forall ((v_prenex_18 (_ BitVec 32)) (v_prenex_21 (_ BitVec 32))) (or (not (= (select |c_#valid| v_prenex_21) (_ bv0 1))) (bvule (bvadd |c_~#a6~0.offset| (_ bv4 32)) (select (store |c_#length| v_prenex_21 v_prenex_18) |c_~#a6~0.base|)))) (exists ((v_prenex_17 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_17)))))) is different from false [2019-12-07 12:38:03,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 12:38:04,373 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 12:38:04,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62307714] [2019-12-07 12:38:04,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:04,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 9] imperfect sequences [] total 14 [2019-12-07 12:38:04,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270727045] [2019-12-07 12:38:04,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:38:04,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:38:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:38:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=121, Unknown=8, NotChecked=24, Total=210 [2019-12-07 12:38:04,374 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 15 states. [2019-12-07 12:38:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:18,822 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-12-07 12:38:18,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:38:18,823 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-12-07 12:38:18,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:18,823 INFO L225 Difference]: With dead ends: 54 [2019-12-07 12:38:18,824 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 12:38:18,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=105, Invalid=195, Unknown=10, NotChecked=32, Total=342 [2019-12-07 12:38:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 12:38:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 12:38:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 12:38:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-12-07 12:38:18,826 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 29 [2019-12-07 12:38:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:18,826 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-12-07 12:38:18,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:38:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-12-07 12:38:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:38:18,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:18,827 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] [2019-12-07 12:38:19,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 12:38:19,028 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:38:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:19,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1970951303, now seen corresponding path program 1 times [2019-12-07 12:38:19,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:38:19,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176795821] [2019-12-07 12:38:19,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:38:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:38:19,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:19,160 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 12:38:19,160 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:38:19,195 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 12:38:19,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176795821] [2019-12-07 12:38:19,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:19,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 12:38:19,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976069597] [2019-12-07 12:38:19,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:19,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:38:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:19,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:19,197 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 5 states. [2019-12-07 12:38:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:19,200 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2019-12-07 12:38:19,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:38:19,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 12:38:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:19,201 INFO L225 Difference]: With dead ends: 42 [2019-12-07 12:38:19,201 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 12:38:19,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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 12:38:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 12:38:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 12:38:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 12:38:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2019-12-07 12:38:19,203 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 37 [2019-12-07 12:38:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:19,203 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2019-12-07 12:38:19,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2019-12-07 12:38:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:38:19,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:19,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:19,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 12:38:19,405 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, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 12:38:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1874562474, now seen corresponding path program 1 times [2019-12-07 12:38:19,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:38:19,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464748648] [2019-12-07 12:38:19,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_488dc419-4a41-4a26-99c0-d5c34b400563/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 12:38:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:38:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:38:19,590 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 12:38:19,590 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:38:19,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 12:38:19,807 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 12:38:19,811 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 12:38:19,811 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 6bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2019-12-07 12:38:19,811 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 12:38:19,811 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 10bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2019-12-07 12:38:19,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:38:19 BoogieIcfgContainer [2019-12-07 12:38:19,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:38:19,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:38:19,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:38:19,820 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:38:19,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:56" (3/4) ... [2019-12-07 12:38:19,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:38:19,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:38:19,823 INFO L168 Benchmark]: Toolchain (without parser) took 324548.38 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 802.2 MB). Free memory was 948.4 MB in the beginning and 638.6 MB in the end (delta: 309.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 12:38:19,823 INFO L168 Benchmark]: CDTParser took 0.14 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 12:38:19,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -124.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:19,823 INFO L168 Benchmark]: Boogie Preprocessor took 63.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:19,824 INFO L168 Benchmark]: RCFGBuilder took 900.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 944.1 MB in the end (delta: 121.7 MB). Peak memory consumption was 121.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:19,824 INFO L168 Benchmark]: TraceAbstraction took 323127.90 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 682.6 MB). Free memory was 944.1 MB in the beginning and 638.6 MB in the end (delta: 305.5 MB). Peak memory consumption was 988.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:19,824 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.8 GB. Free memory is still 638.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:38:19,825 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.14 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 450.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -124.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 900.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 944.1 MB in the end (delta: 121.7 MB). Peak memory consumption was 121.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 323127.90 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 682.6 MB). Free memory was 944.1 MB in the beginning and 638.6 MB in the end (delta: 305.5 MB). Peak memory consumption was 988.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.8 GB. Free memory is still 638.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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 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# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 790. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L782] 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}] [L791] CALL entry_point() VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L784] CALL, EXPR probe1_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] 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] [L784] RET, EXPR probe1_6(&a6) VAL [a6={3:0}, ldv_global_msg_list={7:0}, probe1_6(&a6)=0] [L784] int ret = probe1_6(&a6); [L785] COND TRUE ret==0 VAL [a6={3:0}, ldv_global_msg_list={7:0}, ret=0] [L786] FCALL disconnect_2_6(&a6) VAL [a6={3:0}, ldv_global_msg_list={7:0}, ret=0] [L788] a6.p = 0 VAL [a6={3:0}, ldv_global_msg_list={7:0}, ret=0] [L791] RET entry_point() VAL [a6={3:0}, ldv_global_msg_list={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 51 procedures, 365 locations, 78 error locations. Result: UNSAFE, OverallTime: 323.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 292.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 592 SDtfs, 884 SDslu, 1227 SDs, 0 SdLazy, 996 SolverSat, 341 SolverUnsat, 81 SolverUnknown, 0 SolverNotchecked, 168.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 633 GetRequests, 488 SyntacticMatches, 34 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 142.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred 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, 12 MinimizatonAttempts, 53 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 584 ConstructedInterpolants, 104 QuantifiedInterpolants, 141582 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1366 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...