./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/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 e977fbeb632c2e5a16902a6c2250cf608217c650 ............................................................................................................................ 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_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/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 e977fbeb632c2e5a16902a6c2250cf608217c650 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:45:22,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:45:22,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:45:22,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:45:22,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:45:22,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:45:22,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:45:22,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:45:22,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:45:22,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:45:22,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:45:22,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:45:22,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:45:22,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:45:22,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:45:22,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:45:22,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:45:22,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:45:22,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:45:22,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:45:22,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:45:22,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:45:22,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:45:22,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:45:22,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:45:22,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:45:22,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:45:22,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:45:22,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:45:22,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:45:22,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:45:22,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:45:22,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:45:22,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:45:22,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:45:22,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:45:22,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:45:22,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:45:22,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:45:22,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:45:22,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:45:22,256 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 14:45:22,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:45:22,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:45:22,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:45:22,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:45:22,268 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:45:22,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:45:22,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:45:22,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:45:22,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:45:22,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:45:22,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:45:22,269 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:45:22,269 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:45:22,270 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:45:22,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:45:22,270 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:45:22,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:45:22,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:45:22,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:45:22,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:45:22,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:45:22,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:45:22,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:45:22,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:45:22,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:45:22,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:45:22,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:45:22,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:45:22,272 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_80eb412e-7e42-4b89-a417-5cf77e436821/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 -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-12-07 14:45:22,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:45:22,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:45:22,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:45:22,390 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:45:22,391 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:45:22,391 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-12-07 14:45:22,428 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data/015f90920/6ce5ec268d5d47978f1eeb0a632e8a47/FLAG531be9ebd [2019-12-07 14:45:22,886 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:45:22,887 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-12-07 14:45:22,896 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data/015f90920/6ce5ec268d5d47978f1eeb0a632e8a47/FLAG531be9ebd [2019-12-07 14:45:22,905 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data/015f90920/6ce5ec268d5d47978f1eeb0a632e8a47 [2019-12-07 14:45:22,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:45:22,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 14:45:22,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:45:22,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:45:22,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:45:22,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:45:22" (1/1) ... [2019-12-07 14:45:22,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fb40e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:22, skipping insertion in model container [2019-12-07 14:45:22,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:45:22" (1/1) ... [2019-12-07 14:45:22,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:45:22,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:45:23,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:45:23,214 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-12-07 14:45:23,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@23e7187c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:23, skipping insertion in model container [2019-12-07 14:45:23,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:45:23,214 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 14:45:23,216 INFO L168 Benchmark]: Toolchain (without parser) took 307.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:23,217 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:45:23,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:23,218 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:45:24,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:45:24,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:45:24,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:45:24,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:45:24,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:45:24,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:45:24,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:45:24,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:45:24,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:45:24,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:45:24,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:45:24,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:45:24,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:45:24,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:45:24,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:45:24,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:45:24,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:45:24,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:45:24,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:45:24,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:45:24,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:45:24,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:45:24,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:45:24,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:45:24,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:45:24,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:45:24,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:45:24,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:45:24,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:45:24,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:45:24,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:45:24,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:45:24,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:45:24,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:45:24,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:45:24,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:45:24,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:45:24,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:45:24,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:45:24,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:45:24,385 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 14:45:24,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:45:24,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:45:24,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:45:24,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:45:24,396 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:45:24,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:45:24,396 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:45:24,396 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:45:24,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:45:24,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:45:24,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:45:24,397 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:45:24,397 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:45:24,397 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:45:24,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:45:24,397 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:45:24,398 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:45:24,398 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:45:24,398 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:45:24,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:45:24,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:45:24,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:45:24,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:45:24,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:45:24,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:45:24,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:45:24,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:45:24,399 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 14:45:24,399 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:45:24,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:45:24,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:45:24,399 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_80eb412e-7e42-4b89-a417-5cf77e436821/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 -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-12-07 14:45:24,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:45:24,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:45:24,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:45:24,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:45:24,574 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:45:24,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-12-07 14:45:24,611 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data/53788d3b8/cf948357dda34705b7457ffb24fe8a69/FLAG5241bc2a7 [2019-12-07 14:45:25,119 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:45:25,119 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-12-07 14:45:25,130 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data/53788d3b8/cf948357dda34705b7457ffb24fe8a69/FLAG5241bc2a7 [2019-12-07 14:45:25,593 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/data/53788d3b8/cf948357dda34705b7457ffb24fe8a69 [2019-12-07 14:45:25,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:45:25,596 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 14:45:25,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:45:25,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:45:25,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:45:25,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:45:25" (1/1) ... [2019-12-07 14:45:25,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:25, skipping insertion in model container [2019-12-07 14:45:25,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:45:25" (1/1) ... [2019-12-07 14:45:25,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:45:25,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:45:25,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:45:25,899 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 14:45:25,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:45:25,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:45:25,964 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:45:25,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:45:26,052 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:45:26,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26 WrapperNode [2019-12-07 14:45:26,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:45:26,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:45:26,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:45:26,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:45:26,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (1/1) ... [2019-12-07 14:45:26,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (1/1) ... [2019-12-07 14:45:26,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (1/1) ... [2019-12-07 14:45:26,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (1/1) ... [2019-12-07 14:45:26,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (1/1) ... [2019-12-07 14:45:26,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (1/1) ... [2019-12-07 14:45:26,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (1/1) ... [2019-12-07 14:45:26,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:45:26,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:45:26,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:45:26,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:45:26,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:45:26,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 14:45:26,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:45:26,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 14:45:26,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 14:45:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 14:45:26,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 14:45:26,158 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 14:45:26,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 14:45:26,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 14:45:26,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 14:45:26,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 14:45:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 14:45:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 14:45:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 14:45:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 14:45:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 14:45:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 14:45:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 14:45:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 14:45:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 14:45:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 14:45:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 14:45:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 14:45:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 14:45:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 14:45:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 14:45:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 14:45:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 14:45:26,502 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:45:26,729 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:45:26,931 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:45:26,932 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 14:45:26,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:45:26 BoogieIcfgContainer [2019-12-07 14:45:26,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:45:26,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:45:26,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:45:26,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:45:26,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:45:25" (1/3) ... [2019-12-07 14:45:26,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31629ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:45:26, skipping insertion in model container [2019-12-07 14:45:26,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:26" (2/3) ... [2019-12-07 14:45:26,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31629ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:45:26, skipping insertion in model container [2019-12-07 14:45:26,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:45:26" (3/3) ... [2019-12-07 14:45:26,938 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2019-12-07 14:45:26,945 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:45:26,950 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-12-07 14:45:26,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-12-07 14:45:26,971 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:45:26,971 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:45:26,971 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:45:26,971 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:45:26,971 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:45:26,971 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:45:26,971 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:45:26,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:45:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-12-07 14:45:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:45:26,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:26,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:26,991 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999723, now seen corresponding path program 1 times [2019-12-07 14:45:27,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:27,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014868059] [2019-12-07 14:45:27,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:27,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:45:27,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:27,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:27,191 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:27,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:27,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:27,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:45:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:27,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:27,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014868059] [2019-12-07 14:45:27,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:27,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:45:27,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606041778] [2019-12-07 14:45:27,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:45:27,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:45:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:27,271 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-12-07 14:45:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:27,455 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-12-07 14:45:27,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:45:27,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 14:45:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:27,465 INFO L225 Difference]: With dead ends: 133 [2019-12-07 14:45:27,465 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 14:45:27,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 14:45:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2019-12-07 14:45:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 14:45:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-12-07 14:45:27,501 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 17 [2019-12-07 14:45:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:27,501 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-12-07 14:45:27,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:45:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-12-07 14:45:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:45:27,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:27,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:27,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:45:27,703 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:27,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999724, now seen corresponding path program 1 times [2019-12-07 14:45:27,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:27,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100147701] [2019-12-07 14:45:27,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:27,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:45:27,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:27,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:27,809 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:27,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:27,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:27,816 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:45:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:27,853 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:28,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100147701] [2019-12-07 14:45:28,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:28,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 14:45:28,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286609226] [2019-12-07 14:45:28,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:45:28,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:45:28,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:45:28,112 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2019-12-07 14:45:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:28,596 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-12-07 14:45:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:45:28,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 14:45:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:28,599 INFO L225 Difference]: With dead ends: 129 [2019-12-07 14:45:28,599 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 14:45:28,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:45:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 14:45:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-12-07 14:45:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 14:45:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-12-07 14:45:28,612 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 17 [2019-12-07 14:45:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:28,612 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-12-07 14:45:28,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:45:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-12-07 14:45:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:45:28,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:28,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:28,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:45:28,815 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:28,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1513628874, now seen corresponding path program 1 times [2019-12-07 14:45:28,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:28,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757160731] [2019-12-07 14:45:28,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:28,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:45:28,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:28,950 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:28,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757160731] [2019-12-07 14:45:28,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:28,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 14:45:28,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523159578] [2019-12-07 14:45:28,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:45:28,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:45:28,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:28,977 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 5 states. [2019-12-07 14:45:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:28,994 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-12-07 14:45:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:45:28,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 14:45:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:28,995 INFO L225 Difference]: With dead ends: 123 [2019-12-07 14:45:28,995 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 14:45:28,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 14:45:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-12-07 14:45:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 14:45:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-12-07 14:45:29,003 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 17 [2019-12-07 14:45:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:29,004 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-12-07 14:45:29,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:45:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-12-07 14:45:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:45:29,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:29,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:29,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:45:29,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:29,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1578542280, now seen corresponding path program 1 times [2019-12-07 14:45:29,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:29,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708477525] [2019-12-07 14:45:29,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:29,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:45:29,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:29,350 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:29,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708477525] [2019-12-07 14:45:29,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:29,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 14:45:29,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47938287] [2019-12-07 14:45:29,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:45:29,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:29,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:45:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:29,398 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 5 states. [2019-12-07 14:45:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:29,413 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-12-07 14:45:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:45:29,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 14:45:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:29,415 INFO L225 Difference]: With dead ends: 123 [2019-12-07 14:45:29,415 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 14:45:29,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 14:45:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-12-07 14:45:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 14:45:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-12-07 14:45:29,424 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 29 [2019-12-07 14:45:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:29,424 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-12-07 14:45:29,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:45:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-12-07 14:45:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:45:29,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:29,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:29,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:45:29,628 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash 581469927, now seen corresponding path program 1 times [2019-12-07 14:45:29,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:29,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551762881] [2019-12-07 14:45:29,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:29,755 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:45:29,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:29,794 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:29,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551762881] [2019-12-07 14:45:29,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:29,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 14:45:29,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542713743] [2019-12-07 14:45:29,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:45:29,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:45:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:45:29,822 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 7 states. [2019-12-07 14:45:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:29,861 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-12-07 14:45:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:45:29,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-07 14:45:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:29,863 INFO L225 Difference]: With dead ends: 134 [2019-12-07 14:45:29,863 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 14:45:29,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:45:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 14:45:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-12-07 14:45:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 14:45:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-12-07 14:45:29,873 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 29 [2019-12-07 14:45:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:29,873 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-12-07 14:45:29,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:45:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-12-07 14:45:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 14:45:29,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:29,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:30,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:45:30,077 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:30,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1899216601, now seen corresponding path program 1 times [2019-12-07 14:45:30,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:30,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889648621] [2019-12-07 14:45:30,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:30,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:45:30,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:30,254 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:30,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889648621] [2019-12-07 14:45:30,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:30,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:45:30,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306577568] [2019-12-07 14:45:30,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:45:30,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:45:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:45:30,290 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 6 states. [2019-12-07 14:45:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:30,323 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-12-07 14:45:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:45:30,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 14:45:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:30,324 INFO L225 Difference]: With dead ends: 136 [2019-12-07 14:45:30,325 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 14:45:30,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:45:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 14:45:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-12-07 14:45:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 14:45:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2019-12-07 14:45:30,331 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 32 [2019-12-07 14:45:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:30,331 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2019-12-07 14:45:30,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:45:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2019-12-07 14:45:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:45:30,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:30,332 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:30,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:45:30,534 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:30,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2034413241, now seen corresponding path program 1 times [2019-12-07 14:45:30,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:30,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503497599] [2019-12-07 14:45:30,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:30,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:45:30,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:30,732 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:30,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503497599] [2019-12-07 14:45:30,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:45:30,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 14:45:30,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153585193] [2019-12-07 14:45:30,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:45:30,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:30,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:45:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:45:30,819 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 10 states. [2019-12-07 14:45:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:31,074 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-12-07 14:45:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:45:31,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-07 14:45:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:31,077 INFO L225 Difference]: With dead ends: 140 [2019-12-07 14:45:31,077 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 14:45:31,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:45:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 14:45:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-12-07 14:45:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 14:45:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-12-07 14:45:31,088 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 34 [2019-12-07 14:45:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:31,088 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-12-07 14:45:31,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:45:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-12-07 14:45:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 14:45:31,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:31,090 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:31,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:45:31,292 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash 76391075, now seen corresponding path program 1 times [2019-12-07 14:45:31,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:31,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912698033] [2019-12-07 14:45:31,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:31,391 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:45:31,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:45:31,402 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:45:31,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912698033] [2019-12-07 14:45:31,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:31,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:45:31,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040725954] [2019-12-07 14:45:31,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:31,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:31,495 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 3 states. [2019-12-07 14:45:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:31,618 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2019-12-07 14:45:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:31,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 14:45:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:31,620 INFO L225 Difference]: With dead ends: 147 [2019-12-07 14:45:31,620 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 14:45:31,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 14:45:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-12-07 14:45:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 14:45:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2019-12-07 14:45:31,624 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 32 [2019-12-07 14:45:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:31,624 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2019-12-07 14:45:31,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2019-12-07 14:45:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:45:31,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:31,625 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:31,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:45:31,827 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272825, now seen corresponding path program 2 times [2019-12-07 14:45:31,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:31,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096451531] [2019-12-07 14:45:31,829 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:31,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 14:45:31,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:45:31,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:45:31,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:31,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:31,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:31,969 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:31,970 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:31,970 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:45:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:45:32,067 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:45:32,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096451531] [2019-12-07 14:45:32,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:32,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-12-07 14:45:32,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684838863] [2019-12-07 14:45:32,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:45:32,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:45:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:45:32,114 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 12 states. [2019-12-07 14:45:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:32,869 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-12-07 14:45:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:45:32,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-12-07 14:45:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:32,870 INFO L225 Difference]: With dead ends: 146 [2019-12-07 14:45:32,870 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 14:45:32,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:45:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 14:45:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2019-12-07 14:45:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 14:45:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2019-12-07 14:45:32,877 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 38 [2019-12-07 14:45:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:32,877 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2019-12-07 14:45:32,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:45:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2019-12-07 14:45:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:45:32,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:32,878 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:33,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 14:45:33,080 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:33,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:33,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272824, now seen corresponding path program 1 times [2019-12-07 14:45:33,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:33,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424072507] [2019-12-07 14:45:33,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:33,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:45:33,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:33,307 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:33,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424072507] [2019-12-07 14:45:33,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:45:33,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-12-07 14:45:33,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140025795] [2019-12-07 14:45:33,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:45:33,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:45:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:45:33,575 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 18 states. [2019-12-07 14:45:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:34,349 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-12-07 14:45:34,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 14:45:34,350 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-12-07 14:45:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:34,351 INFO L225 Difference]: With dead ends: 134 [2019-12-07 14:45:34,351 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 14:45:34,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:45:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 14:45:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-12-07 14:45:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 14:45:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2019-12-07 14:45:34,355 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 38 [2019-12-07 14:45:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:34,355 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2019-12-07 14:45:34,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:45:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2019-12-07 14:45:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:45:34,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:34,356 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:34,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 14:45:34,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2061530616, now seen corresponding path program 2 times [2019-12-07 14:45:34,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:34,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899439711] [2019-12-07 14:45:34,560 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:34,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 14:45:34,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:45:34,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 14:45:34,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:34,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:34,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:34,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:34,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:34,760 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:45:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 14:45:34,909 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 14:45:35,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899439711] [2019-12-07 14:45:35,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:35,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-12-07 14:45:35,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934985742] [2019-12-07 14:45:35,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 14:45:35,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:35,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 14:45:35,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:45:35,723 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2019-12-07 14:45:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:38,019 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-12-07 14:45:38,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:45:38,020 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-12-07 14:45:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:38,021 INFO L225 Difference]: With dead ends: 129 [2019-12-07 14:45:38,021 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 14:45:38,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:45:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 14:45:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-12-07 14:45:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 14:45:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-12-07 14:45:38,024 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 46 [2019-12-07 14:45:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:38,025 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-12-07 14:45:38,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 14:45:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-12-07 14:45:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:45:38,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:38,026 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:38,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 14:45:38,227 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:38,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731192, now seen corresponding path program 1 times [2019-12-07 14:45:38,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:38,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242208826] [2019-12-07 14:45:38,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:38,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 14:45:38,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:38,517 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:39,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242208826] [2019-12-07 14:45:39,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:45:39,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-12-07 14:45:39,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505635138] [2019-12-07 14:45:39,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 14:45:39,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 14:45:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 14:45:39,443 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 34 states. [2019-12-07 14:45:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:40,077 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-12-07 14:45:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:45:40,078 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-12-07 14:45:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:40,079 INFO L225 Difference]: With dead ends: 135 [2019-12-07 14:45:40,079 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 14:45:40,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 14:45:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 14:45:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-12-07 14:45:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 14:45:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-12-07 14:45:40,083 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 51 [2019-12-07 14:45:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:40,083 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-12-07 14:45:40,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 14:45:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-12-07 14:45:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:45:40,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:40,084 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:40,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 14:45:40,285 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:40,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash -346949160, now seen corresponding path program 2 times [2019-12-07 14:45:40,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:40,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394909487] [2019-12-07 14:45:40,288 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:40,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 14:45:40,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:45:40,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:45:40,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:40,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:40,393 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:40,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:40,395 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:40,395 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:45:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:40,492 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:40,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394909487] [2019-12-07 14:45:40,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:40,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-12-07 14:45:40,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657875658] [2019-12-07 14:45:40,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:45:40,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:40,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:45:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:45:40,536 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 12 states. [2019-12-07 14:45:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:41,107 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2019-12-07 14:45:41,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:45:41,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 14:45:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:41,109 INFO L225 Difference]: With dead ends: 153 [2019-12-07 14:45:41,109 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 14:45:41,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:45:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 14:45:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2019-12-07 14:45:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 14:45:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-12-07 14:45:41,113 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 53 [2019-12-07 14:45:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:41,113 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-12-07 14:45:41,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:45:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-12-07 14:45:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:45:41,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:41,114 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:41,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 14:45:41,315 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash -346949159, now seen corresponding path program 1 times [2019-12-07 14:45:41,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:41,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279496948] [2019-12-07 14:45:41,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:41,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 14:45:41,525 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:41,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:41,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:41,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:41,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:41,537 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:45:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:41,717 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:42,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279496948] [2019-12-07 14:45:42,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:42,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-12-07 14:45:42,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750157141] [2019-12-07 14:45:42,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 14:45:42,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:42,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 14:45:42,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:45:42,514 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 23 states. [2019-12-07 14:45:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:44,571 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-12-07 14:45:44,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:45:44,572 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-12-07 14:45:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:44,573 INFO L225 Difference]: With dead ends: 127 [2019-12-07 14:45:44,573 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 14:45:44,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:45:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 14:45:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-12-07 14:45:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 14:45:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-12-07 14:45:44,576 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 53 [2019-12-07 14:45:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:44,576 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-12-07 14:45:44,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 14:45:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-12-07 14:45:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 14:45:44,577 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:44,577 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:44,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 14:45:44,778 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1487182461, now seen corresponding path program 1 times [2019-12-07 14:45:44,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:44,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467157434] [2019-12-07 14:45:44,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:44,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:45:44,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:44,971 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:45,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467157434] [2019-12-07 14:45:45,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:45,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-12-07 14:45:45,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584833922] [2019-12-07 14:45:45,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:45:45,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:45,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:45:45,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:45:45,048 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2019-12-07 14:45:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:45,076 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-12-07 14:45:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:45:45,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-07 14:45:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:45,078 INFO L225 Difference]: With dead ends: 129 [2019-12-07 14:45:45,078 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 14:45:45,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:45:45,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 14:45:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-12-07 14:45:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 14:45:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2019-12-07 14:45:45,082 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 58 [2019-12-07 14:45:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:45,082 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2019-12-07 14:45:45,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:45:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2019-12-07 14:45:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:45:45,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:45,082 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:45,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 14:45:45,283 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -537222574, now seen corresponding path program 1 times [2019-12-07 14:45:45,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:45,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357590676] [2019-12-07 14:45:45,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:45,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:45:45,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:45,452 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:45,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:45:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:45,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357590676] [2019-12-07 14:45:45,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:45,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-12-07 14:45:45,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79721278] [2019-12-07 14:45:45,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:45:45,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:45:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:45:45,601 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 11 states. [2019-12-07 14:45:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:45,658 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-12-07 14:45:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:45:45,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-12-07 14:45:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:45,659 INFO L225 Difference]: With dead ends: 131 [2019-12-07 14:45:45,660 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 14:45:45,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:45:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 14:45:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-12-07 14:45:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 14:45:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-12-07 14:45:45,663 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 63 [2019-12-07 14:45:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:45,663 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-12-07 14:45:45,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:45:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-12-07 14:45:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:45:45,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:45,664 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:45,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 14:45:45,865 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:45,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash -964060479, now seen corresponding path program 1 times [2019-12-07 14:45:45,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:45,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365152341] [2019-12-07 14:45:45,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:46,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 14:45:46,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:46,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:46,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:46,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:46,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:46,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:45:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:46,274 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:46,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365152341] [2019-12-07 14:45:46,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:46,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-12-07 14:45:46,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186914155] [2019-12-07 14:45:46,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 14:45:46,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:46,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 14:45:46,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:45:46,388 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 17 states. [2019-12-07 14:45:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:47,369 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2019-12-07 14:45:47,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 14:45:47,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-12-07 14:45:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:47,370 INFO L225 Difference]: With dead ends: 178 [2019-12-07 14:45:47,370 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 14:45:47,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:45:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 14:45:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-12-07 14:45:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 14:45:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2019-12-07 14:45:47,376 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 74 [2019-12-07 14:45:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:47,377 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2019-12-07 14:45:47,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 14:45:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2019-12-07 14:45:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:45:47,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:47,378 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:47,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 14:45:47,579 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash -964060478, now seen corresponding path program 1 times [2019-12-07 14:45:47,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:47,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892854288] [2019-12-07 14:45:47,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:47,793 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 14:45:47,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:47,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:47,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:47,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:47,805 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:47,805 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:45:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:48,091 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:49,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892854288] [2019-12-07 14:45:49,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:49,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-12-07 14:45:49,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66299357] [2019-12-07 14:45:49,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 14:45:49,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:49,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 14:45:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 14:45:49,763 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 33 states. [2019-12-07 14:45:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:52,914 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2019-12-07 14:45:52,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 14:45:52,915 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-12-07 14:45:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:52,916 INFO L225 Difference]: With dead ends: 152 [2019-12-07 14:45:52,916 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 14:45:52,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 14:45:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 14:45:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-12-07 14:45:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 14:45:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2019-12-07 14:45:52,921 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 74 [2019-12-07 14:45:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:52,921 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2019-12-07 14:45:52,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 14:45:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2019-12-07 14:45:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 14:45:52,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:52,922 INFO L410 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:53,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 14:45:53,123 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash -770520951, now seen corresponding path program 1 times [2019-12-07 14:45:53,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:53,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666992239] [2019-12-07 14:45:53,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:53,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:45:53,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:53,350 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-12-07 14:45:53,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666992239] [2019-12-07 14:45:53,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:45:53,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2019-12-07 14:45:53,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333641769] [2019-12-07 14:45:53,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:45:53,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:45:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:45:53,505 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 10 states. [2019-12-07 14:45:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:53,566 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2019-12-07 14:45:53,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:45:53,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-12-07 14:45:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:53,567 INFO L225 Difference]: With dead ends: 153 [2019-12-07 14:45:53,568 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 14:45:53,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:45:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 14:45:53,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-12-07 14:45:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 14:45:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2019-12-07 14:45:53,580 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 77 [2019-12-07 14:45:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:53,580 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2019-12-07 14:45:53,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:45:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2019-12-07 14:45:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:45:53,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:53,581 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:53,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 14:45:53,782 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash 810528448, now seen corresponding path program 1 times [2019-12-07 14:45:53,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:53,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417129813] [2019-12-07 14:45:53,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:54,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 14:45:54,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:54,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:54,058 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:54,061 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:54,061 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:54,061 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:45:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:54,317 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:54,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417129813] [2019-12-07 14:45:54,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:54,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-12-07 14:45:54,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023807303] [2019-12-07 14:45:54,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 14:45:54,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:54,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 14:45:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:45:54,474 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 21 states. [2019-12-07 14:45:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:55,703 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2019-12-07 14:45:55,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:45:55,704 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-12-07 14:45:55,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:55,705 INFO L225 Difference]: With dead ends: 180 [2019-12-07 14:45:55,705 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 14:45:55,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-12-07 14:45:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 14:45:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 155. [2019-12-07 14:45:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 14:45:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2019-12-07 14:45:55,709 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 87 [2019-12-07 14:45:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:55,709 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2019-12-07 14:45:55,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 14:45:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2019-12-07 14:45:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:45:55,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:55,710 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:55,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 14:45:55,911 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:45:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash 810528449, now seen corresponding path program 1 times [2019-12-07 14:45:55,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:45:55,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042709816] [2019-12-07 14:45:55,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 14:45:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:56,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 14:45:56,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:56,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:45:56,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:45:56,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:45:56,112 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:45:56,112 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:45:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:56,549 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:45:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:45:58,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042709816] [2019-12-07 14:45:58,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:58,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-12-07 14:45:58,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538605706] [2019-12-07 14:45:58,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 14:45:58,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:45:58,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 14:45:58,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 14:45:58,955 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 41 states. [2019-12-07 14:46:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:03,047 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2019-12-07 14:46:03,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:46:03,048 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2019-12-07 14:46:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:03,049 INFO L225 Difference]: With dead ends: 153 [2019-12-07 14:46:03,049 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 14:46:03,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 14:46:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 14:46:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-12-07 14:46:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 14:46:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2019-12-07 14:46:03,053 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 87 [2019-12-07 14:46:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:03,053 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2019-12-07 14:46:03,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 14:46:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2019-12-07 14:46:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:46:03,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:03,054 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:03,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 14:46:03,254 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:46:03,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 147123437, now seen corresponding path program 1 times [2019-12-07 14:46:03,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:46:03,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43993438] [2019-12-07 14:46:03,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:03,461 INFO L264 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 14:46:03,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:46:04,066 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:46:04,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43993438] [2019-12-07 14:46:04,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:04,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-12-07 14:46:04,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485362882] [2019-12-07 14:46:04,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 14:46:04,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:46:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 14:46:04,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 14:46:04,851 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 40 states. [2019-12-07 14:46:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:06,628 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2019-12-07 14:46:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:46:06,629 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-12-07 14:46:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:06,630 INFO L225 Difference]: With dead ends: 152 [2019-12-07 14:46:06,630 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 14:46:06,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 14:46:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 14:46:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-12-07 14:46:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 14:46:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2019-12-07 14:46:06,634 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 90 [2019-12-07 14:46:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:06,634 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2019-12-07 14:46:06,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 14:46:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2019-12-07 14:46:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 14:46:06,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:06,634 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:06,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 14:46:06,835 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 14:46:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2088002500, now seen corresponding path program 1 times [2019-12-07 14:46:06,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:46:06,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070317800] [2019-12-07 14:46:06,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:07,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 116 conjunts are in the unsatisfiable core [2019-12-07 14:46:07,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:07,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 14:46:07,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:07,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 14:46:07,221 INFO L343 Elim1Store]: treesize reduction 34, result has 22.7 percent of original size [2019-12-07 14:46:07,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 14:46:07,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:07,234 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,234 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-12-07 14:46:07,315 INFO L343 Elim1Store]: treesize reduction 80, result has 20.8 percent of original size [2019-12-07 14:46:07,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2019-12-07 14:46:07,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:07,335 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,335 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-12-07 14:46:07,473 INFO L343 Elim1Store]: treesize reduction 141, result has 18.0 percent of original size [2019-12-07 14:46:07,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2019-12-07 14:46:07,474 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:07,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-12-07 14:46:07,628 INFO L343 Elim1Store]: treesize reduction 172, result has 16.9 percent of original size [2019-12-07 14:46:07,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 66 [2019-12-07 14:46:07,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:07,655 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,655 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-12-07 14:46:07,821 INFO L343 Elim1Store]: treesize reduction 246, result has 15.2 percent of original size [2019-12-07 14:46:07,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 80 [2019-12-07 14:46:07,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:07,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:07,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-12-07 14:46:08,049 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 33 [2019-12-07 14:46:08,049 INFO L343 Elim1Store]: treesize reduction 332, result has 13.8 percent of original size [2019-12-07 14:46:08,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 80 treesize of output 94 [2019-12-07 14:46:08,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:08,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:08,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:08,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2019-12-07 14:46:08,367 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-12-07 14:46:08,368 INFO L343 Elim1Store]: treesize reduction 430, result has 12.6 percent of original size [2019-12-07 14:46:08,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 91 treesize of output 108 [2019-12-07 14:46:08,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:08,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:08,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:08,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2019-12-07 14:46:08,763 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 43 [2019-12-07 14:46:08,764 INFO L343 Elim1Store]: treesize reduction 540, result has 11.6 percent of original size [2019-12-07 14:46:08,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 102 treesize of output 122 [2019-12-07 14:46:08,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:08,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:08,814 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:08,814 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:103 [2019-12-07 14:46:09,260 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 48 [2019-12-07 14:46:09,260 INFO L343 Elim1Store]: treesize reduction 662, result has 10.8 percent of original size [2019-12-07 14:46:09,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 113 treesize of output 136 [2019-12-07 14:46:09,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:09,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:09,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:09,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:114 [2019-12-07 14:46:09,804 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 53 [2019-12-07 14:46:09,805 INFO L343 Elim1Store]: treesize reduction 796, result has 10.1 percent of original size [2019-12-07 14:46:09,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 124 treesize of output 150 [2019-12-07 14:46:09,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:09,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:09,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:09,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:129, output treesize:125 [2019-12-07 14:46:10,510 WARN L192 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 58 [2019-12-07 14:46:10,510 INFO L343 Elim1Store]: treesize reduction 942, result has 9.4 percent of original size [2019-12-07 14:46:10,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 135 treesize of output 164 [2019-12-07 14:46:10,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:10,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:10,589 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:10,589 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:136 [2019-12-07 14:46:11,370 WARN L192 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 63 [2019-12-07 14:46:11,371 INFO L343 Elim1Store]: treesize reduction 1100, result has 8.9 percent of original size [2019-12-07 14:46:11,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 78 case distinctions, treesize of input 146 treesize of output 178 [2019-12-07 14:46:11,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:11,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:11,463 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:11,464 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:151, output treesize:147 [2019-12-07 14:46:12,376 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 450 DAG size of output: 68 [2019-12-07 14:46:12,376 INFO L343 Elim1Store]: treesize reduction 1270, result has 8.4 percent of original size [2019-12-07 14:46:12,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 91 case distinctions, treesize of input 157 treesize of output 192 [2019-12-07 14:46:12,377 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:12,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:12,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:12,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:162, output treesize:158 [2019-12-07 14:46:13,545 WARN L192 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 512 DAG size of output: 73 [2019-12-07 14:46:13,546 INFO L343 Elim1Store]: treesize reduction 1452, result has 7.9 percent of original size [2019-12-07 14:46:13,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 105 case distinctions, treesize of input 168 treesize of output 206 [2019-12-07 14:46:13,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:13,649 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 14:46:13,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:13,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:13,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:173, output treesize:169 [2019-12-07 14:46:13,935 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 14:46:14,898 WARN L192 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 578 DAG size of output: 78 [2019-12-07 14:46:14,898 INFO L343 Elim1Store]: treesize reduction 1646, result has 7.5 percent of original size [2019-12-07 14:46:14,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 120 case distinctions, treesize of input 179 treesize of output 220 [2019-12-07 14:46:14,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:15,009 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 14:46:15,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:15,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:15,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:179, output treesize:175 [2019-12-07 14:46:15,357 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 14:46:18,087 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:46:18,131 INFO L614 ElimStorePlain]: treesize reduction 88, result has 32.3 percent of original size [2019-12-07 14:46:18,132 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:46:18,132 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:42 [2019-12-07 14:46:20,139 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_internal_#in~kobj.base|) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_1) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_2) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_3) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_4) .cse0 .cse0) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |c_#memory_$Pointer$.offset|)) is different from true [2019-12-07 14:46:22,148 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_#in~kobj.base| (let ((.cse0 (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_#in~kobj.base|) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_1) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_2) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_3) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_4) .cse0 .cse0) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv8 32)) .cse0))) |c_#memory_$Pointer$.offset|)) is different from true [2019-12-07 14:46:22,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:22,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:22,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 185 treesize of output 195 [2019-12-07 14:46:22,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:22,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:22,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:22,299 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:188, output treesize:114 [2019-12-07 14:46:25,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:46:25,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:25,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 120 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 135 treesize of output 123 [2019-12-07 14:46:25,646 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:25,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:25,671 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:25,671 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:92 [2019-12-07 14:46:27,480 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:27,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 94 treesize of output 42 [2019-12-07 14:46:27,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:46:27,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:46:27,482 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:46:27,483 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:3 [2019-12-07 14:46:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:46:27,941 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:29,705 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:46:29,718 INFO L614 ElimStorePlain]: treesize reduction 83, result has 24.5 percent of original size [2019-12-07 14:46:29,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:46:29,718 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:27 [2019-12-07 14:46:30,323 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:46:30,379 INFO L614 ElimStorePlain]: treesize reduction 82, result has 34.4 percent of original size [2019-12-07 14:46:30,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:46:30,380 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:43 [2019-12-07 14:48:42,600 WARN L192 SmtUtils]: Spent 2.15 m on a formula simplification that was a NOOP. DAG size: 152 [2019-12-07 14:48:42,855 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 14:48:43,925 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 14:48:45,076 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 14:48:45,540 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 14:48:45,698 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:48:45,837 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:48:45,952 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 14:48:46,123 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:48:46,225 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:48:57,291 WARN L192 SmtUtils]: Spent 11.06 s on a formula simplification that was a NOOP. DAG size: 108 [2019-12-07 14:49:00,517 WARN L192 SmtUtils]: Spent 3.22 s on a formula simplification that was a NOOP. DAG size: 74 [2019-12-07 14:49:04,822 WARN L192 SmtUtils]: Spent 4.30 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 14:49:09,275 WARN L192 SmtUtils]: Spent 4.45 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 14:49:10,368 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 14:49:10,704 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 14:49:10,929 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:49:10,937 INFO L614 ElimStorePlain]: treesize reduction 91, result has 31.1 percent of original size [2019-12-07 14:49:10,937 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:49:10,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:41 [2019-12-07 14:49:12,034 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 14:49:12,269 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:49:12,436 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:49:12,441 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:49:12,488 INFO L614 ElimStorePlain]: treesize reduction 90, result has 37.9 percent of original size [2019-12-07 14:49:12,488 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:49:12,488 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:55 [2019-12-07 14:49:13,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:49:13,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:13,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:13,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:14,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:14,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:14,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:14,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:14,216 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:14,255 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:17,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:17,087 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:17,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:17,110 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:17,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:17,138 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:18,025 WARN L192 SmtUtils]: Spent 886.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:49:18,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:18,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 14:49:18,044 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:18,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:18,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (_ BitVec 32))) (or (exists ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (and (forall ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse0 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|) (_ bv0 32))) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_prenex_2 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (or (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_1) v_prenex_3)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse1 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_prenex_5) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_prenex_4) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_prenex_7) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_prenex_6) .cse1 .cse1) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse1))) v_prenex_1) v_prenex_3)))) (not (= (_ bv0 32) (select (select v_prenex_2 v_prenex_1) v_prenex_3))))))) is different from false [2019-12-07 14:49:18,172 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (_ BitVec 32))) (or (exists ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (and (forall ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse0 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|) (_ bv0 32))) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_prenex_2 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (or (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_1) v_prenex_3)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse1 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_prenex_5) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_prenex_4) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_prenex_7) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_prenex_6) .cse1 .cse1) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse1))) v_prenex_1) v_prenex_3)))) (not (= (_ bv0 32) (select (select v_prenex_2 v_prenex_1) v_prenex_3))))))) is different from true [2019-12-07 14:49:18,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:18,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:18,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:18,223 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:18,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:18,249 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:19,043 WARN L192 SmtUtils]: Spent 794.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:49:19,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:19,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 14:49:19,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:19,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:19,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:19,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:19,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:19,202 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:19,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:19,239 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:20,526 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 81 [2019-12-07 14:49:20,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:20,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 14:49:20,555 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:20,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:20,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (_ BitVec 32))) (or (exists ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (and (forall ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse0 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|) (_ bv0 32))) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_prenex_2 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| c_LDV_INIT_LIST_HEAD_~list.base (store (select |c_#memory_$Pointer$.offset| c_LDV_INIT_LIST_HEAD_~list.base) (bvadd c_LDV_INIT_LIST_HEAD_~list.offset (_ bv4 32)) c_LDV_INIT_LIST_HEAD_~list.offset)) v_prenex_1) v_prenex_3)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse1 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_prenex_5) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_prenex_4) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_prenex_7) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_prenex_6) .cse1 .cse1) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse1))) v_prenex_1) v_prenex_3)))) (not (= (_ bv0 32) (select (select v_prenex_2 v_prenex_1) v_prenex_3))))))) is different from false [2019-12-07 14:49:20,750 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (_ BitVec 32))) (or (exists ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (and (forall ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse0 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|) (_ bv0 32))) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_prenex_2 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| c_LDV_INIT_LIST_HEAD_~list.base (store (select |c_#memory_$Pointer$.offset| c_LDV_INIT_LIST_HEAD_~list.base) (bvadd c_LDV_INIT_LIST_HEAD_~list.offset (_ bv4 32)) c_LDV_INIT_LIST_HEAD_~list.offset)) v_prenex_1) v_prenex_3)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse1 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_prenex_5) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_prenex_4) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_prenex_7) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_prenex_6) .cse1 .cse1) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse1))) v_prenex_1) v_prenex_3)))) (not (= (_ bv0 32) (select (select v_prenex_2 v_prenex_1) v_prenex_3))))))) is different from true [2019-12-07 14:49:20,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:20,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:20,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:20,819 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:20,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:20,863 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:21,971 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 82 [2019-12-07 14:49:21,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:22,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 14:49:22,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:22,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:22,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (_ BitVec 32))) (or (exists ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (and (forall ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse0 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|) (_ bv0 32))) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_prenex_2 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (or (= (select (select (store |c_#memory_$Pointer$.offset| c_LDV_INIT_LIST_HEAD_~list.base (store (store (select |c_#memory_$Pointer$.offset| c_LDV_INIT_LIST_HEAD_~list.base) c_LDV_INIT_LIST_HEAD_~list.offset c_LDV_INIT_LIST_HEAD_~list.offset) (bvadd c_LDV_INIT_LIST_HEAD_~list.offset (_ bv4 32)) c_LDV_INIT_LIST_HEAD_~list.offset)) v_prenex_1) v_prenex_3) (_ bv0 32)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse1 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_prenex_5) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_prenex_4) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_prenex_7) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_prenex_6) .cse1 .cse1) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse1))) v_prenex_1) v_prenex_3)))) (not (= (_ bv0 32) (select (select v_prenex_2 v_prenex_1) v_prenex_3))))))) is different from false [2019-12-07 14:49:22,186 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (_ BitVec 32))) (or (exists ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (and (forall ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse0 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|) (_ bv0 32))) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_prenex_2 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (or (= (select (select (store |c_#memory_$Pointer$.offset| c_LDV_INIT_LIST_HEAD_~list.base (store (store (select |c_#memory_$Pointer$.offset| c_LDV_INIT_LIST_HEAD_~list.base) c_LDV_INIT_LIST_HEAD_~list.offset c_LDV_INIT_LIST_HEAD_~list.offset) (bvadd c_LDV_INIT_LIST_HEAD_~list.offset (_ bv4 32)) c_LDV_INIT_LIST_HEAD_~list.offset)) v_prenex_1) v_prenex_3) (_ bv0 32)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse1 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_prenex_5) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_prenex_4) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_prenex_7) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_prenex_6) .cse1 .cse1) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse1))) v_prenex_1) v_prenex_3)))) (not (= (_ bv0 32) (select (select v_prenex_2 v_prenex_1) v_prenex_3))))))) is different from true [2019-12-07 14:49:22,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:22,216 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:22,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:22,259 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:22,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:22,290 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:23,392 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 14:49:23,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:23,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 14:49:23,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:23,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:23,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (_ BitVec 32))) (or (exists ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (and (forall ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse0 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|) (_ bv0 32))) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_prenex_2 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_#memory_$Pointer$.offset| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) v_prenex_1) v_prenex_3) (_ bv0 32)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse1 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_prenex_5) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_prenex_4) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_prenex_7) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_prenex_6) .cse1 .cse1) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse1))) v_prenex_1) v_prenex_3)))) (not (= (_ bv0 32) (select (select v_prenex_2 v_prenex_1) v_prenex_3))))))) is different from false [2019-12-07 14:49:24,849 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (_ BitVec 32))) (or (exists ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (and (forall ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse0 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|) (_ bv0 32))) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_prenex_2 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_#memory_$Pointer$.offset| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) |c_LDV_INIT_LIST_HEAD_#in~list.offset|)) v_prenex_1) v_prenex_3) (_ bv0 32)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3| (let ((.cse1 (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv4 32)))) (store (store (store (store (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_ldv_kobject_init_internal_#in~kobj.base_BEFORE_CALL_3|) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv12 32)) v_prenex_5) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv13 32)) v_prenex_4) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv14 32)) v_prenex_7) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv15 32)) v_prenex_6) .cse1 .cse1) (bvadd |v_ldv_kobject_init_internal_#in~kobj.offset_BEFORE_CALL_3| (_ bv8 32)) .cse1))) v_prenex_1) v_prenex_3)))) (not (= (_ bv0 32) (select (select v_prenex_2 v_prenex_1) v_prenex_3))))))) is different from true [2019-12-07 14:49:25,000 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4|], 22=[|v_#memory_$Pointer$.offset_1074|]} [2019-12-07 14:49:25,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:49:25,059 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:49:25,190 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 14:49:25,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:49:25,197 INFO L534 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:49:25,310 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-07 14:49:25,311 INFO L614 ElimStorePlain]: treesize reduction 90, result has 51.4 percent of original size [2019-12-07 14:49:45,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070317800] [2019-12-07 14:49:45,337 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. [2019-12-07 14:49:45,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [407353285] [2019-12-07 14:49:45,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:49:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:45,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 113 conjunts are in the unsatisfiable core [2019-12-07 14:49:45,869 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:49:45,871 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@136a609b [2019-12-07 14:49:45,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428552310] [2019-12-07 14:49:45,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80eb412e-7e42-4b89-a417-5cf77e436821/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:49:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:46,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 118 conjunts are in the unsatisfiable core [2019-12-07 14:49:46,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:49:46,097 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@136a609b [2019-12-07 14:49:46,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:46,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 14:49:46,097 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 14:49:46,097 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:49:46,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2019-12-07 14:49:46,709 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2019-12-07 14:49:46,717 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 14:49:46,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:49:46 BoogieIcfgContainer [2019-12-07 14:49:46,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:49:46,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:49:46,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:49:46,718 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:49:46,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:45:26" (3/4) ... [2019-12-07 14:49:46,720 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:49:46,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:49:46,721 INFO L168 Benchmark]: Toolchain (without parser) took 261125.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.6 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 253.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:46,721 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 14:49:46,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:46,722 INFO L168 Benchmark]: Boogie Preprocessor took 62.57 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:46,722 INFO L168 Benchmark]: RCFGBuilder took 816.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 951.6 MB in the end (delta: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:46,722 INFO L168 Benchmark]: TraceAbstraction took 259783.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 951.6 MB in the beginning and 1.0 GB in the end (delta: -88.5 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:46,723 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:49:46,724 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 455.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.57 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 816.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 951.6 MB in the end (delta: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 259783.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 951.6 MB in the beginning and 1.0 GB in the end (delta: -88.5 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. 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 free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L764] CALL entry_point() [L758] struct ldv_kobject *kobj; [L759] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L540] list->next = list [L541] list->prev = list [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; [L759] RET, EXPR ldv_kobject_create() [L759] kobj = ldv_kobject_create() [L760] CALL ldv_kobject_put(kobj) [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; [L666] EXPR v->counter [L666] temp = v->counter [L667] temp -= i [L668] v->counter = temp [L669] return temp; [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L675] CALL release(kref) [L706] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L706] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L707] CALL ldv_kobject_cleanup(kobj) [L699] EXPR kobj->name [L699] char *name = kobj->name; [L700] free(kobj) [L700] free(kobj) [L700] free(kobj) [L701] COND TRUE \read(*name) [L702] free(name) - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 332 locations, 71 error locations. Result: UNKNOWN, OverallTime: 259.7s, OverallIterations: 23, TraceHistogramMax: 16, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2335 SDtfs, 1202 SDslu, 17267 SDs, 0 SdLazy, 9515 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2236 GetRequests, 1811 SyntacticMatches, 48 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 1096 NumberOfCodeBlocks, 1060 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2148 ConstructedInterpolants, 306 QuantifiedInterpolants, 522076 SizeOfPredicates, 128 NumberOfNonLiveVariables, 4719 ConjunctsInSsa, 345 ConjunctsInUnsatCore, 44 InterpolantComputations, 37 PerfectInterpolantSequences, 2985/3246 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...