./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-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_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 2d51915f2a44f0762761fec81bdd888a975b61fb ............................................................................................................................ 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_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 2d51915f2a44f0762761fec81bdd888a975b61fb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:08:21,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:08:21,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:08:21,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:08:21,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:08:21,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:08:21,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:08:21,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:08:21,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:08:21,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:08:21,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:08:21,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:08:21,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:08:21,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:08:21,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:08:21,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:08:21,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:08:21,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:08:21,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:08:21,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:08:21,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:08:21,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:08:21,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:08:21,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:08:21,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:08:21,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:08:21,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:08:21,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:08:21,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:08:21,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:08:21,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:08:21,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:08:21,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:08:21,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:08:21,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:08:21,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:08:21,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:08:21,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:08:21,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:08:21,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:08:21,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:08:21,356 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 16:08:21,365 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:08:21,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:08:21,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:08:21,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:08:21,366 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:08:21,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:08:21,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:08:21,367 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:08:21,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:08:21,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:08:21,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:08:21,367 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:08:21,367 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:08:21,368 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:08:21,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:08:21,368 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:08:21,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:08:21,368 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:08:21,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:08:21,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:08:21,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:08:21,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:08:21,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:08:21,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:08:21,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:08:21,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:08:21,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:08:21,370 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:08:21,370 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_8d65a697-552e-4d8d-a839-fb42694c68e3/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 -> 2d51915f2a44f0762761fec81bdd888a975b61fb [2019-12-07 16:08:21,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:08:21,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:08:21,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:08:21,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:08:21,479 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:08:21,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2019-12-07 16:08:21,518 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data/ccc43eb46/b1952802c8604045a448e1945799e120/FLAGeedeef78a [2019-12-07 16:08:21,905 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:08:21,906 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2019-12-07 16:08:21,918 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data/ccc43eb46/b1952802c8604045a448e1945799e120/FLAGeedeef78a [2019-12-07 16:08:21,928 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data/ccc43eb46/b1952802c8604045a448e1945799e120 [2019-12-07 16:08:21,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:08:21,931 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 16:08:21,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:21,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:08:21,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:08:21,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:21" (1/1) ... [2019-12-07 16:08:21,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e739d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:21, skipping insertion in model container [2019-12-07 16:08:21,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:21" (1/1) ... [2019-12-07 16:08:21,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:08:21,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:08:22,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:22,273 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 16:08:22,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@bbc8950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:22, skipping insertion in model container [2019-12-07 16:08:22,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:22,274 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 16:08:22,275 INFO L168 Benchmark]: Toolchain (without parser) took 343.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:08:22,276 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:08:22,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:08:22,278 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.4 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 16:08:23,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:08:23,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:08:23,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:08:23,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:08:23,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:08:23,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:08:23,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:08:23,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:08:23,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:08:23,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:08:23,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:08:23,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:08:23,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:08:23,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:08:23,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:08:23,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:08:23,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:08:23,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:08:23,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:08:23,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:08:23,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:08:23,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:08:23,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:08:23,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:08:23,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:08:23,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:08:23,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:08:23,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:08:23,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:08:23,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:08:23,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:08:23,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:08:23,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:08:23,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:08:23,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:08:23,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:08:23,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:08:23,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:08:23,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:08:23,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:08:23,467 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 16:08:23,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:08:23,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:08:23,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:08:23,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:08:23,478 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:08:23,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:08:23,478 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:08:23,478 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:08:23,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:08:23,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:08:23,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:08:23,479 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:08:23,479 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:08:23,479 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:08:23,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:08:23,479 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:08:23,479 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:08:23,479 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:08:23,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:08:23,480 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:08:23,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:08:23,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:08:23,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:08:23,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:08:23,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:08:23,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:08:23,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:08:23,481 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 16:08:23,481 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:08:23,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:08:23,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:08:23,481 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_8d65a697-552e-4d8d-a839-fb42694c68e3/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 -> 2d51915f2a44f0762761fec81bdd888a975b61fb [2019-12-07 16:08:23,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:08:23,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:08:23,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:08:23,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:08:23,670 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:08:23,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2019-12-07 16:08:23,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data/e731006fb/7f3764c1e6b24379835691b0d0b9518a/FLAG0983f42ed [2019-12-07 16:08:24,145 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:08:24,145 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2019-12-07 16:08:24,155 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data/e731006fb/7f3764c1e6b24379835691b0d0b9518a/FLAG0983f42ed [2019-12-07 16:08:24,163 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/data/e731006fb/7f3764c1e6b24379835691b0d0b9518a [2019-12-07 16:08:24,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:08:24,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 16:08:24,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:24,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:08:24,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:08:24,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5dd555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24, skipping insertion in model container [2019-12-07 16:08:24,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:08:24,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:08:24,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:24,466 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 16:08:24,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:08:24,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:24,510 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:08:24,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:24,600 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:08:24,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24 WrapperNode [2019-12-07 16:08:24,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:24,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:08:24,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:08:24,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:08:24,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (1/1) ... [2019-12-07 16:08:24,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:08:24,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:08:24,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:08:24,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:08:24,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:08:24,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 16:08:24,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:08:24,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 16:08:24,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 16:08:24,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 16:08:24,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 16:08:24,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 16:08:24,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 16:08:24,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 16:08:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2019-12-07 16:08:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 16:08:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 16:08:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 16:08:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 16:08:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 16:08:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 16:08:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 16:08:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 16:08:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 16:08:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 16:08:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 16:08:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 16:08:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 16:08:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 16:08:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 16:08:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 16:08:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2019-12-07 16:08:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 16:08:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 16:08:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 16:08:25,060 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:08:25,283 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:08:25,551 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:08:25,552 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 16:08:25,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:08:25 BoogieIcfgContainer [2019-12-07 16:08:25,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:08:25,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:08:25,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:08:25,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:08:25,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:08:24" (1/3) ... [2019-12-07 16:08:25,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ef71e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:08:25, skipping insertion in model container [2019-12-07 16:08:25,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:24" (2/3) ... [2019-12-07 16:08:25,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ef71e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:08:25, skipping insertion in model container [2019-12-07 16:08:25,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:08:25" (3/3) ... [2019-12-07 16:08:25,558 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test7-2.i [2019-12-07 16:08:25,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:08:25,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 81 error locations. [2019-12-07 16:08:25,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2019-12-07 16:08:25,589 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:08:25,589 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:08:25,589 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:08:25,589 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:08:25,589 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:08:25,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:08:25,590 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:08:25,590 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:08:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2019-12-07 16:08:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:08:25,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:25,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:25,609 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:08:25,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:25,613 INFO L82 PathProgramCache]: Analyzing trace with hash -667181762, now seen corresponding path program 1 times [2019-12-07 16:08:25,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:08:25,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308601909] [2019-12-07 16:08:25,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:08:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:25,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:08:25,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:08:25,807 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 16:08:25,807 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:08:25,886 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 16:08:25,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308601909] [2019-12-07 16:08:25,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:25,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 16:08:25,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874281448] [2019-12-07 16:08:25,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:08:25,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:08:25,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:08:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:08:25,909 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 5 states. [2019-12-07 16:08:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:25,976 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-12-07 16:08:25,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:08:25,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 16:08:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:25,988 INFO L225 Difference]: With dead ends: 84 [2019-12-07 16:08:25,988 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 16:08:25,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 16:08:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 16:08:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2019-12-07 16:08:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 16:08:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-12-07 16:08:26,023 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 23 [2019-12-07 16:08:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:26,023 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-12-07 16:08:26,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:08:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-12-07 16:08:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:08:26,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:26,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:26,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:08:26,225 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:08:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1260306412, now seen corresponding path program 1 times [2019-12-07 16:08:26,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:08:26,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539582982] [2019-12-07 16:08:26,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:08:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:26,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:08:26,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:08:26,348 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 16:08:26,349 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:08:26,382 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 16:08:26,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539582982] [2019-12-07 16:08:26,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:26,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:08:26,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439837987] [2019-12-07 16:08:26,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:08:26,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:08:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:08:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:08:26,385 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-12-07 16:08:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:26,408 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-12-07 16:08:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:08:26,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 16:08:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:26,410 INFO L225 Difference]: With dead ends: 63 [2019-12-07 16:08:26,410 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 16:08:26,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 16:08:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 16:08:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 16:08:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 16:08:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-12-07 16:08:26,416 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 23 [2019-12-07 16:08:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:26,417 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-12-07 16:08:26,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:08:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-12-07 16:08:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:08:26,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:26,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:26,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:08:26,619 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:08:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:26,619 INFO L82 PathProgramCache]: Analyzing trace with hash -538099043, now seen corresponding path program 1 times [2019-12-07 16:08:26,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:08:26,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087177407] [2019-12-07 16:08:26,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:08:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:26,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:08:26,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:08:26,812 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 16:08:26,812 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:08:26,870 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 16:08:26,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087177407] [2019-12-07 16:08:26,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:26,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 16:08:26,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102845805] [2019-12-07 16:08:26,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:08:26,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:08:26,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:08:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:08:26,872 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 10 states. [2019-12-07 16:08:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:26,918 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-12-07 16:08:26,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:08:26,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 16:08:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:26,919 INFO L225 Difference]: With dead ends: 77 [2019-12-07 16:08:26,919 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 16:08:26,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:08:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 16:08:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2019-12-07 16:08:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 16:08:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-12-07 16:08:26,925 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2019-12-07 16:08:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:26,926 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-12-07 16:08:26,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:08:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-12-07 16:08:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:08:26,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:26,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:27,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:08:27,129 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:08:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash -414792645, now seen corresponding path program 1 times [2019-12-07 16:08:27,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:08:27,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474068862] [2019-12-07 16:08:27,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:08:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:27,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:08:27,307 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:08:27,405 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 16:08:27,405 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:08:27,483 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 16:08:27,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474068862] [2019-12-07 16:08:27,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:27,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-12-07 16:08:27,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656260576] [2019-12-07 16:08:27,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:08:27,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:08:27,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:08:27,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:08:27,484 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 10 states. [2019-12-07 16:08:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:27,677 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2019-12-07 16:08:27,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:08:27,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-07 16:08:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:27,679 INFO L225 Difference]: With dead ends: 111 [2019-12-07 16:08:27,679 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 16:08:27,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:08:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 16:08:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2019-12-07 16:08:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 16:08:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-12-07 16:08:27,684 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 24 [2019-12-07 16:08:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:27,685 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-12-07 16:08:27,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:08:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-12-07 16:08:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:08:27,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:27,685 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] [2019-12-07 16:08:27,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:08:27,888 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:08:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash 26330358, now seen corresponding path program 1 times [2019-12-07 16:08:27,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:08:27,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019107400] [2019-12-07 16:08:27,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:08:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:28,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:08:28,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:08:28,069 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 16:08:28,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:08:28,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:08:28,073 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:08:28,073 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:08:28,100 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 16:08:28,100 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:08:28,128 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 16:08:28,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019107400] [2019-12-07 16:08:28,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:28,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-12-07 16:08:28,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695417776] [2019-12-07 16:08:28,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:08:28,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:08:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:08:28,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:08:28,130 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-12-07 16:08:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:28,252 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2019-12-07 16:08:28,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:08:28,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 16:08:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:28,254 INFO L225 Difference]: With dead ends: 86 [2019-12-07 16:08:28,254 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 16:08:28,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:08:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 16:08:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2019-12-07 16:08:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 16:08:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-12-07 16:08:28,259 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 25 [2019-12-07 16:08:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:28,259 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-12-07 16:08:28,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:08:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-12-07 16:08:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:08:28,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:28,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:28,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:08:28,463 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:08:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash 498121534, now seen corresponding path program 1 times [2019-12-07 16:08:28,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:08:28,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352109111] [2019-12-07 16:08:28,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:08:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:28,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:08:28,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:08:30,654 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 16:08:30,655 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:08:38,762 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_14|)))) (= (store |c_#valid| |c_entry_point_~#a7~0.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|))) is different from false [2019-12-07 16:08:38,812 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|))) is different from false [2019-12-07 16:08:38,824 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,831 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,836 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,849 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,855 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 16:08:38,866 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, v_prenex_4], 5=[v_prenex_5]} [2019-12-07 16:08:38,868 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1)))))) (forall ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|) (not (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1))))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_4 (store |c_#valid| v_prenex_3 (_ bv0 1))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_3 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (not (= v_prenex_4 (store v_prenex_5 v_prenex_7 (_ bv0 1)))) (= (select v_prenex_5 v_prenex_7) (_ bv0 1)))))))) is different from false [2019-12-07 16:08:38,882 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1)))))) (forall ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|) (not (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1))))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_4 (store |c_#valid| v_prenex_3 (_ bv0 1))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_3 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (not (= v_prenex_4 (store v_prenex_5 v_prenex_7 (_ bv0 1)))) (= (select v_prenex_5 v_prenex_7) (_ bv0 1)))))))) is different from true [2019-12-07 16:08:38,887 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 16:08:38,894 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, v_prenex_4], 5=[v_prenex_5]} [2019-12-07 16:08:38,896 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,901 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 16:08:38,907 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, v_prenex_4], 5=[v_prenex_5]} [2019-12-07 16:08:38,909 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,914 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 16:08:38,920 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, v_prenex_4], 5=[v_prenex_5]} [2019-12-07 16:08:38,922 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,927 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 16:08:38,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_entry_point_~#a7~0.base_16|))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|) (exists ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_14|)))))) is different from false [2019-12-07 16:08:38,942 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 16:08:38,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352109111] [2019-12-07 16:08:38,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:38,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 8] imperfect sequences [] total 10 [2019-12-07 16:08:38,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656427949] [2019-12-07 16:08:38,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:08:38,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:08:38,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:08:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=22, Unknown=13, NotChecked=52, Total=110 [2019-12-07 16:08:38,944 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 11 states. [2019-12-07 16:08:46,987 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 16:08:46,995 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1)))))) (forall ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|) (not (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1))))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_4 (store |c_#valid| v_prenex_3 (_ bv0 1))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_3 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (not (= v_prenex_4 (store v_prenex_5 v_prenex_7 (_ bv0 1)))) (= (select v_prenex_5 v_prenex_7) (_ bv0 1))))))))) is different from false [2019-12-07 16:09:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:15,321 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-12-07 16:09:15,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:09:15,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-07 16:09:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:15,323 INFO L225 Difference]: With dead ends: 83 [2019-12-07 16:09:15,323 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 16:09:15,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=27, Invalid=24, Unknown=15, NotChecked=90, Total=156 [2019-12-07 16:09:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 16:09:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 16:09:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 16:09:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-12-07 16:09:15,328 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 24 [2019-12-07 16:09:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:15,328 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-12-07 16:09:15,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:09:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-12-07 16:09:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:09:15,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:15,329 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] [2019-12-07 16:09:15,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 16:09:15,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:09:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash -479228267, now seen corresponding path program 1 times [2019-12-07 16:09:15,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:09:15,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601774513] [2019-12-07 16:09:15,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:09:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:15,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:09:15,673 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:09:15,692 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 16:09:15,692 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:09:15,718 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 16:09:15,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601774513] [2019-12-07 16:09:15,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:15,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 16:09:15,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627903130] [2019-12-07 16:09:15,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:09:15,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:09:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:09:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:09:15,720 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-12-07 16:09:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:15,740 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-12-07 16:09:15,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:09:15,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 16:09:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:15,742 INFO L225 Difference]: With dead ends: 65 [2019-12-07 16:09:15,742 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 16:09:15,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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 16:09:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 16:09:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 16:09:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 16:09:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-12-07 16:09:15,747 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 25 [2019-12-07 16:09:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:15,747 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-12-07 16:09:15,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:09:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-12-07 16:09:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:09:15,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:15,748 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 16:09:15,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 16:09:15,950 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:09:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash 720529802, now seen corresponding path program 1 times [2019-12-07 16:09:15,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:09:15,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943787319] [2019-12-07 16:09:15,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:09:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:16,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:09:16,094 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:09:16,097 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 16:09:16,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:09:16,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:09:16,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:09:16,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:09:16,154 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:09:16,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 16:09:16,155 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:09:16,168 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 16:09:16,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:09:16,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 16:09:16,272 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 16:09:16,272 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:09:18,489 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 16:09:18,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943787319] [2019-12-07 16:09:18,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:18,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-12-07 16:09:18,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402030384] [2019-12-07 16:09:18,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:09:18,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:09:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:09:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:09:18,490 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 14 states. [2019-12-07 16:09:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:27,003 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-12-07 16:09:27,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:09:27,003 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-12-07 16:09:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:27,004 INFO L225 Difference]: With dead ends: 61 [2019-12-07 16:09:27,004 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 16:09:27,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:09:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 16:09:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-12-07 16:09:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 16:09:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-12-07 16:09:27,009 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 29 [2019-12-07 16:09:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:27,009 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-12-07 16:09:27,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:09:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-12-07 16:09:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:09:27,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:27,010 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 16:09:27,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 16:09:27,212 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:09:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash 720529803, now seen corresponding path program 1 times [2019-12-07 16:09:27,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:09:27,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117390526] [2019-12-07 16:09:27,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:09:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:27,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:09:27,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:09:27,342 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 16:09:27,342 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:09:27,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:09:27,363 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 16:09:27,363 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:09:27,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:09:27,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:09:27,368 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:09:29,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:09:29,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 16:09:29,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:09:29,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:09:29,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:09:29,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:09:29,451 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:09:29,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:09:29,459 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:09:29,459 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2019-12-07 16:09:29,538 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 16:09:29,539 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:09:29,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:09:29,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:09:29,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:09:29,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:09:32,889 WARN L192 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 16:09:32,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:09:35,411 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 16:09:35,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117390526] [2019-12-07 16:09:35,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:35,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-12-07 16:09:35,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643702861] [2019-12-07 16:09:35,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:09:35,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:09:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:09:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=169, Unknown=3, NotChecked=0, Total=210 [2019-12-07 16:09:35,413 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 15 states. [2019-12-07 16:09:43,773 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 12 [2019-12-07 16:10:36,620 WARN L192 SmtUtils]: Spent 37.83 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-12-07 16:11:32,325 WARN L192 SmtUtils]: Spent 13.95 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 16:11:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:48,643 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-12-07 16:11:48,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:11:48,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-12-07 16:11:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:48,644 INFO L225 Difference]: With dead ends: 59 [2019-12-07 16:11:48,644 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 16:11:48,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 74.3s TimeCoverageRelationStatistics Valid=74, Invalid=298, Unknown=8, NotChecked=0, Total=380 [2019-12-07 16:11:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 16:11:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 16:11:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 16:11:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-12-07 16:11:48,648 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 29 [2019-12-07 16:11:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:48,648 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-12-07 16:11:48,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:11:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-12-07 16:11:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:11:48,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:48,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:48,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 16:11:48,850 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:11:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:48,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1404304926, now seen corresponding path program 1 times [2019-12-07 16:11:48,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:11:48,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535697078] [2019-12-07 16:11:48,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:11:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:11:48,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:11:48,950 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:11:48,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 16:11:48,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:11:48,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:11:48,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:11:48,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 16:11:57,103 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 16:11:57,103 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:12:14,902 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,905 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from false [2019-12-07 16:12:14,915 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from true [2019-12-07 16:12:14,917 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,921 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,924 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,927 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) is different from false [2019-12-07 16:12:14,946 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) is different from true [2019-12-07 16:12:14,949 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,952 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,955 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,958 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,961 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,964 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,967 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,970 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,977 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,980 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,984 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,987 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:14,989 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:14,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))))) is different from false [2019-12-07 16:12:15,031 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:15,034 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:15,045 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (= (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_40| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1))))) is different from true [2019-12-07 16:12:15,049 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-12-07 16:12:15,063 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-12-07 16:12:15,074 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13, v_prenex_16], 24=[v_prenex_17]} [2019-12-07 16:12:15,077 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:15,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse0 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38)) (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse1 v_prenex_15) (_ bv0 1))) (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (not (= v_prenex_13 (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (and (not (= v_prenex_16 (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1)) (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse2 (store v_prenex_17 v_prenex_24 (_ bv1 1)))) (and (= (select v_prenex_17 v_prenex_24) (_ bv0 1)) (= (select .cse2 v_prenex_23) (_ bv0 1)) (not (= v_prenex_20 (store (store .cse2 v_prenex_23 (_ bv0 1)) v_prenex_24 (_ bv0 1))))))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21))) (= v_prenex_20 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) v_prenex_18 (_ bv0 1))))) (forall ((v_prenex_22 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse3 (store v_prenex_17 v_prenex_19 (_ bv1 1)))) (or (= (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_19 (_ bv0 1)) v_prenex_16) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (select v_prenex_17 v_prenex_19) (_ bv0 1)))))))))) is different from false [2019-12-07 16:12:15,116 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse0 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38)) (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse1 v_prenex_15) (_ bv0 1))) (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (not (= v_prenex_13 (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (and (not (= v_prenex_16 (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1)) (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse2 (store v_prenex_17 v_prenex_24 (_ bv1 1)))) (and (= (select v_prenex_17 v_prenex_24) (_ bv0 1)) (= (select .cse2 v_prenex_23) (_ bv0 1)) (not (= v_prenex_20 (store (store .cse2 v_prenex_23 (_ bv0 1)) v_prenex_24 (_ bv0 1))))))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21))) (= v_prenex_20 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) v_prenex_18 (_ bv0 1))))) (forall ((v_prenex_22 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse3 (store v_prenex_17 v_prenex_19 (_ bv1 1)))) (or (= (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_19 (_ bv0 1)) v_prenex_16) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (select v_prenex_17 v_prenex_19) (_ bv0 1)))))))))) is different from true [2019-12-07 16:12:15,121 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:12:15,129 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:12:15,131 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13, v_prenex_16], 24=[v_prenex_17]} [2019-12-07 16:12:15,134 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:15,141 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:12:15,148 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:12:15,151 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13, v_prenex_16], 24=[v_prenex_17]} [2019-12-07 16:12:15,154 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:15,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_41| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse0 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38)) (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse1 v_prenex_15) (_ bv0 1))) (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (not (= v_prenex_13 (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_41| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_41|))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (and (not (= v_prenex_16 (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1)) (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse2 (store v_prenex_17 v_prenex_24 (_ bv1 1)))) (and (= (select v_prenex_17 v_prenex_24) (_ bv0 1)) (= (select .cse2 v_prenex_23) (_ bv0 1)) (not (= v_prenex_20 (store (store .cse2 v_prenex_23 (_ bv0 1)) v_prenex_24 (_ bv0 1))))))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21))) (= v_prenex_20 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) v_prenex_18 (_ bv0 1))))) (forall ((v_prenex_22 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse3 (store v_prenex_17 v_prenex_19 (_ bv1 1)))) (or (= (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_19 (_ bv0 1)) v_prenex_16) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (select v_prenex_17 v_prenex_19) (_ bv0 1)))))))))) is different from false [2019-12-07 16:12:15,194 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_41| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse0 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38)) (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse1 v_prenex_15) (_ bv0 1))) (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (not (= v_prenex_13 (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_41| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_41|))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (and (not (= v_prenex_16 (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1)) (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse2 (store v_prenex_17 v_prenex_24 (_ bv1 1)))) (and (= (select v_prenex_17 v_prenex_24) (_ bv0 1)) (= (select .cse2 v_prenex_23) (_ bv0 1)) (not (= v_prenex_20 (store (store .cse2 v_prenex_23 (_ bv0 1)) v_prenex_24 (_ bv0 1))))))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21))) (= v_prenex_20 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) v_prenex_18 (_ bv0 1))))) (forall ((v_prenex_22 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse3 (store v_prenex_17 v_prenex_19 (_ bv1 1)))) (or (= (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_19 (_ bv0 1)) v_prenex_16) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (select v_prenex_17 v_prenex_19) (_ bv0 1)))))))))) is different from true [2019-12-07 16:12:15,199 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:12:15,206 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:12:15,209 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13, v_prenex_16], 24=[v_prenex_17]} [2019-12-07 16:12:15,212 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:15,216 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:12:15,219 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 16:12:16,720 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 16:12:16,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535697078] [2019-12-07 16:12:16,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:12:16,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 13] imperfect sequences [] total 21 [2019-12-07 16:12:16,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746893835] [2019-12-07 16:12:16,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 16:12:16,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:12:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 16:12:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=164, Unknown=39, NotChecked=198, Total=462 [2019-12-07 16:12:16,722 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 22 states. [2019-12-07 16:12:47,447 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse0 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38)) (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse1 v_prenex_15) (_ bv0 1))) (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (not (= v_prenex_13 (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (and (not (= v_prenex_16 (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1)) (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse2 (store v_prenex_17 v_prenex_24 (_ bv1 1)))) (and (= (select v_prenex_17 v_prenex_24) (_ bv0 1)) (= (select .cse2 v_prenex_23) (_ bv0 1)) (not (= v_prenex_20 (store (store .cse2 v_prenex_23 (_ bv0 1)) v_prenex_24 (_ bv0 1))))))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21))) (= v_prenex_20 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) v_prenex_18 (_ bv0 1))))) (forall ((v_prenex_22 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse3 (store v_prenex_17 v_prenex_19 (_ bv1 1)))) (or (= (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_19 (_ bv0 1)) v_prenex_16) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (select v_prenex_17 v_prenex_19) (_ bv0 1)))))))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-07 16:12:47,456 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1)))))))) is different from false [2019-12-07 16:12:47,461 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1)))))))) is different from true [2019-12-07 16:12:47,468 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)))) is different from false [2019-12-07 16:13:01,912 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) is different from false [2019-12-07 16:13:01,917 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_38 (_ BitVec 32))) (and (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1))) (not (= (select .cse0 v_prenex_15) (_ bv0 1))) (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_38)) (not (= v_prenex_13 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_35 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (select .cse1 v_probe1_6_~p~0.base_35) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) is different from true [2019-12-07 16:13:46,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:46,200 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-12-07 16:13:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:13:46,202 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-12-07 16:13:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:46,202 INFO L225 Difference]: With dead ends: 71 [2019-12-07 16:13:46,202 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 16:13:46,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=108, Invalid=275, Unknown=77, NotChecked=470, Total=930 [2019-12-07 16:13:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 16:13:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-12-07 16:13:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 16:13:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-12-07 16:13:46,205 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 33 [2019-12-07 16:13:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:46,205 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-12-07 16:13:46,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 16:13:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-12-07 16:13:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 16:13:46,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:46,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:46,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 16:13:46,407 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:13:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -91545904, now seen corresponding path program 1 times [2019-12-07 16:13:46,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:13:46,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168124039] [2019-12-07 16:13:46,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:13:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:46,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:13:46,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:13:46,592 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 16:13:46,593 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:13:46,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:46,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-12-07 16:13:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:46,628 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:13:46,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:46,629 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:13:46,629 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-12-07 16:13:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:13:46,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168124039] [2019-12-07 16:13:46,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:13:46,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 16:13:46,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713513092] [2019-12-07 16:13:46,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:13:46,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:13:46,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:13:46,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:13:46,640 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 7 states. [2019-12-07 16:13:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:46,735 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-12-07 16:13:46,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:13:46,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-07 16:13:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:46,735 INFO L225 Difference]: With dead ends: 59 [2019-12-07 16:13:46,735 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 16:13:46,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:13:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 16:13:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-12-07 16:13:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 16:13:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-12-07 16:13:46,738 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 37 [2019-12-07 16:13:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:46,738 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-12-07 16:13:46,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:13:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-12-07 16:13:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 16:13:46,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:46,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:46,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 16:13:46,939 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:13:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash -91545903, now seen corresponding path program 1 times [2019-12-07 16:13:46,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:13:46,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443439821] [2019-12-07 16:13:46,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:13:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:47,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 16:13:47,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:13:47,174 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 16:13:47,174 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:13:47,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:47,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 16:13:47,392 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:13:47,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:47,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:13:47,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-12-07 16:13:47,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:47,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-12-07 16:13:47,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:47,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:47,586 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:13:47,616 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:47,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:47,617 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:13:47,617 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:26 [2019-12-07 16:13:47,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:47,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:47,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:48,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:48,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:48,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:48,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:49,196 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 16:13:49,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443439821] [2019-12-07 16:13:49,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:13:49,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-12-07 16:13:49,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456289947] [2019-12-07 16:13:49,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:13:49,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:13:49,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:13:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:13:49,197 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 14 states. [2019-12-07 16:13:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:49,559 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-12-07 16:13:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:13:49,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-12-07 16:13:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:49,561 INFO L225 Difference]: With dead ends: 58 [2019-12-07 16:13:49,562 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 16:13:49,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:13:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 16:13:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-12-07 16:13:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 16:13:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-12-07 16:13:49,565 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 37 [2019-12-07 16:13:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:49,565 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-12-07 16:13:49,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:13:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-12-07 16:13:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 16:13:49,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:49,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:49,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 16:13:49,767 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:13:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1457044639, now seen corresponding path program 1 times [2019-12-07 16:13:49,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:13:49,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395844955] [2019-12-07 16:13:49,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:13:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:49,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 16:13:49,854 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:13:49,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:13:49,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:13:49,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:49,890 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:13:49,891 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 16:13:49,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:13:49,930 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:13:49,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:49,932 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:13:49,932 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 16:13:49,943 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 16:13:49,943 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:13:50,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 16:13:50,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:13:50,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:50,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 16:13:50,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 16:13:50,043 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 16:13:50,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395844955] [2019-12-07 16:13:50,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:13:50,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2019-12-07 16:13:50,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934360091] [2019-12-07 16:13:50,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:13:50,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:13:50,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:13:50,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:13:50,044 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 11 states. [2019-12-07 16:13:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:50,206 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-12-07 16:13:50,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:13:50,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-12-07 16:13:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:50,207 INFO L225 Difference]: With dead ends: 57 [2019-12-07 16:13:50,207 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 16:13:50,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:13:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 16:13:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-12-07 16:13:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 16:13:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-12-07 16:13:50,210 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 38 [2019-12-07 16:13:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:50,210 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-12-07 16:13:50,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:13:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-12-07 16:13:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:13:50,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:50,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:50,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 16:13:50,411 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:13:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2076256016, now seen corresponding path program 1 times [2019-12-07 16:13:50,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:13:50,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082385073] [2019-12-07 16:13:50,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:13:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:50,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 16:13:50,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:13:50,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:13:50,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:13:50,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:50,667 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 16:13:50,667 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2019-12-07 16:13:50,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 16:13:50,767 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:13:50,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:50,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:13:50,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-12-07 16:13:50,802 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 16:13:50,802 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:13:51,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 16:13:51,059 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:13:51,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:51,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:13:51,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-12-07 16:13:51,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:13:51,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:51,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:51,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:51,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:13:51,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:51,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:13:51,353 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 16:13:51,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082385073] [2019-12-07 16:13:51,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:13:51,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 21 [2019-12-07 16:13:51,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495851746] [2019-12-07 16:13:51,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 16:13:51,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:13:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 16:13:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:13:51,355 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 22 states. [2019-12-07 16:13:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:51,997 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-12-07 16:13:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:13:51,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-12-07 16:13:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:51,999 INFO L225 Difference]: With dead ends: 56 [2019-12-07 16:13:51,999 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 16:13:51,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:13:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 16:13:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-12-07 16:13:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 16:13:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-12-07 16:13:52,001 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 39 [2019-12-07 16:13:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:52,001 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-12-07 16:13:52,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 16:13:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-12-07 16:13:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 16:13:52,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:52,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:52,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 16:13:52,203 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:13:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1456366955, now seen corresponding path program 1 times [2019-12-07 16:13:52,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:13:52,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718290321] [2019-12-07 16:13:52,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:13:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:52,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:13:52,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:13:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:13:52,404 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:13:52,435 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 16:13:52,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718290321] [2019-12-07 16:13:52,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:13:52,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 16:13:52,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815413792] [2019-12-07 16:13:52,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:13:52,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:13:52,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:13:52,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:13:52,436 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 5 states. [2019-12-07 16:13:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:52,442 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-12-07 16:13:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:13:52,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 16:13:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:52,442 INFO L225 Difference]: With dead ends: 58 [2019-12-07 16:13:52,442 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 16:13:52,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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 16:13:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 16:13:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-12-07 16:13:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 16:13:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-12-07 16:13:52,444 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 38 [2019-12-07 16:13:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:52,445 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-12-07 16:13:52,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:13:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-12-07 16:13:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:13:52,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:52,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:52,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 16:13:52,647 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:13:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash 433789337, now seen corresponding path program 1 times [2019-12-07 16:13:52,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:13:52,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748818815] [2019-12-07 16:13:52,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:13:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:52,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:13:52,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:13:52,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 16:13:52,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:13:52,892 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:52,893 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:13:52,893 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 16:13:52,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 16:13:52,917 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:13:52,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:13:52,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:13:52,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 16:14:01,028 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 16:14:01,028 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:14:14,578 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,580 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))))) is different from false [2019-12-07 16:14:14,590 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))))) is different from true [2019-12-07 16:14:14,592 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,595 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,596 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,598 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1))))) is different from false [2019-12-07 16:14:14,611 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1))))) is different from true [2019-12-07 16:14:14,613 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,616 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,618 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,620 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,623 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,625 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,628 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,637 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,640 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,642 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,644 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,646 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,648 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,650 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,653 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,655 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,659 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,661 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,664 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|))) is different from false [2019-12-07 16:14:14,680 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|))) is different from true [2019-12-07 16:14:14,720 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,722 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:14,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_127|) (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1))))) is different from false [2019-12-07 16:14:14,733 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_127|) (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1))))) is different from true [2019-12-07 16:14:14,738 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2019-12-07 16:14:14,946 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6660 conjuctions. This might take some time... [2019-12-07 16:14:14,972 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 12 conjuctions. [2019-12-07 16:14:14,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:14,976 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_25, v_prenex_29], 24=[v_prenex_30]} [2019-12-07 16:14:14,977 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:15,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_28 (_ BitVec 32)) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse0 (store v_prenex_30 v_prenex_32 (_ bv1 1)))) (and (not (= v_prenex_29 (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1)))) (= (select .cse0 v_prenex_34) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_30 v_prenex_32))))) (= v_prenex_29 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_prenex_28 (_ bv0 1))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_31 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31) (_ bv0 1)) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_30 v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse1 v_prenex_36) (_ bv0 1))) (= v_prenex_33 (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1))) (not (= (_ bv0 1) (select v_prenex_30 v_prenex_35)))))) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_28 (_ bv0 1)))))))) (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_25) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70) (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26)) (not (= (store (store .cse2 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (select .cse2 v_prenex_27) (_ bv0 1))))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (forall ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (or (not (= (select .cse3 v_probe1_6_~p~0.base_67) (_ bv0 1))) (= (store (store .cse3 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)))))))))) is different from false [2019-12-07 16:14:15,031 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_28 (_ BitVec 32)) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse0 (store v_prenex_30 v_prenex_32 (_ bv1 1)))) (and (not (= v_prenex_29 (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1)))) (= (select .cse0 v_prenex_34) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_30 v_prenex_32))))) (= v_prenex_29 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_prenex_28 (_ bv0 1))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_31 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31) (_ bv0 1)) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_30 v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse1 v_prenex_36) (_ bv0 1))) (= v_prenex_33 (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1))) (not (= (_ bv0 1) (select v_prenex_30 v_prenex_35)))))) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_28 (_ bv0 1)))))))) (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_25) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70) (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26)) (not (= (store (store .cse2 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (select .cse2 v_prenex_27) (_ bv0 1))))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (forall ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (or (not (= (select .cse3 v_probe1_6_~p~0.base_67) (_ bv0 1))) (= (store (store .cse3 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)))))))))) is different from true [2019-12-07 16:14:15,034 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-12-07 16:14:15,043 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-12-07 16:14:15,051 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_33, |v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:15,053 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_29], 9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[v_prenex_30]} [2019-12-07 16:14:15,067 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_28 (_ BitVec 32)) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse0 (store v_prenex_30 v_prenex_32 (_ bv1 1)))) (and (not (= v_prenex_29 (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1)))) (= (select .cse0 v_prenex_34) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_30 v_prenex_32))))) (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_25) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70) (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26)) (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (select .cse1 v_prenex_27) (_ bv0 1))))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (forall ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (or (not (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))) (= (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)))))))) (= v_prenex_29 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_prenex_28 (_ bv0 1))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_31 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31) (_ bv0 1)) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store v_prenex_30 v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse3 v_prenex_36) (_ bv0 1))) (= v_prenex_33 (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1))) (not (= (_ bv0 1) (select v_prenex_30 v_prenex_35)))))) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_28 (_ bv0 1)))))))) is different from false [2019-12-07 16:14:15,084 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_28 (_ BitVec 32)) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse0 (store v_prenex_30 v_prenex_32 (_ bv1 1)))) (and (not (= v_prenex_29 (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1)))) (= (select .cse0 v_prenex_34) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_30 v_prenex_32))))) (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_25) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70) (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26)) (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (select .cse1 v_prenex_27) (_ bv0 1))))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (forall ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (or (not (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))) (= (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)))))))) (= v_prenex_29 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_prenex_28 (_ bv0 1))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_31 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31) (_ bv0 1)) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store v_prenex_30 v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse3 v_prenex_36) (_ bv0 1))) (= v_prenex_33 (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1))) (not (= (_ bv0 1) (select v_prenex_30 v_prenex_35)))))) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_28 (_ bv0 1)))))))) is different from true [2019-12-07 16:14:15,087 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:14:15,091 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:14:15,093 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_33, |v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:15,094 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_29], 9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[v_prenex_30]} [2019-12-07 16:14:15,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_28 (_ BitVec 32)) (|v_ldv_malloc_#res.base_110| (_ BitVec 32)) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |c_#valid| |v_ldv_malloc_#res.base_110|) (_ bv0 1))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse0 (store v_prenex_30 v_prenex_32 (_ bv1 1)))) (and (not (= v_prenex_29 (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1)))) (= (select .cse0 v_prenex_34) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_30 v_prenex_32))))) (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_25) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70) (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26)) (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (select .cse1 v_prenex_27) (_ bv0 1))))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (forall ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (or (not (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))) (= (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)))))))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_31 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31) (_ bv0 1)) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store v_prenex_30 v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse3 v_prenex_36) (_ bv0 1))) (= v_prenex_33 (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1))) (not (= (_ bv0 1) (select v_prenex_30 v_prenex_35)))))) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_28 (_ bv0 1)))))) (= (store (store |c_#valid| |v_ldv_malloc_#res.base_110| (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_29))) is different from false [2019-12-07 16:14:15,120 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_28 (_ BitVec 32)) (|v_ldv_malloc_#res.base_110| (_ BitVec 32)) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |c_#valid| |v_ldv_malloc_#res.base_110|) (_ bv0 1))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse0 (store v_prenex_30 v_prenex_32 (_ bv1 1)))) (and (not (= v_prenex_29 (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1)))) (= (select .cse0 v_prenex_34) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_30 v_prenex_32))))) (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_25) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70) (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26)) (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (select .cse1 v_prenex_27) (_ bv0 1))))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (forall ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (or (not (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))) (= (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)))))))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_31 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31) (_ bv0 1)) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store v_prenex_30 v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse3 v_prenex_36) (_ bv0 1))) (= v_prenex_33 (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1))) (not (= (_ bv0 1) (select v_prenex_30 v_prenex_35)))))) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_28 (_ bv0 1)))))) (= (store (store |c_#valid| |v_ldv_malloc_#res.base_110| (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_29))) is different from true [2019-12-07 16:14:15,123 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:14:15,127 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 16:14:15,129 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_33, |v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:15,130 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_29], 9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[v_prenex_30]} [2019-12-07 16:14:15,132 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:14:15,135 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 16:14:15,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_46| (_ BitVec 32)) (v_probe1_6_~p~0.base_70 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (let ((.cse0 (store |c_#valid| |v_entry_point_~#a7~0.base_46| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_70))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_67)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_43|))))) (= (store (store .cse0 v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_46| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |c_#valid| |v_entry_point_~#a7~0.base_46|) (_ bv0 1)))))) is different from false [2019-12-07 16:14:15,177 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 16:14:15,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748818815] [2019-12-07 16:14:15,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:15,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 14] imperfect sequences [] total 22 [2019-12-07 16:14:15,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766964804] [2019-12-07 16:14:15,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 16:14:15,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:14:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 16:14:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=149, Unknown=34, NotChecked=264, Total=506 [2019-12-07 16:14:15,178 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 23 states. [2019-12-07 16:14:47,594 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((v_prenex_28 (_ BitVec 32)) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse0 (store v_prenex_30 v_prenex_32 (_ bv1 1)))) (and (not (= v_prenex_29 (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1)))) (= (select .cse0 v_prenex_34) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_30 v_prenex_32))))) (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_25) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70) (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26)) (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (select .cse1 v_prenex_27) (_ bv0 1))))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (forall ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (or (not (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))) (= (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)))))))) (= v_prenex_29 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_prenex_28 (_ bv0 1))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_31 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31) (_ bv0 1)) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store v_prenex_30 v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse3 v_prenex_36) (_ bv0 1))) (= v_prenex_33 (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1))) (not (= (_ bv0 1) (select v_prenex_30 v_prenex_35)))))) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_28 (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-07 16:14:47,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_28 (_ BitVec 32)) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse0 (store v_prenex_30 v_prenex_32 (_ bv1 1)))) (and (not (= v_prenex_29 (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1)))) (= (select .cse0 v_prenex_34) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_30 v_prenex_32))))) (= v_prenex_29 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_prenex_28 (_ bv0 1))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_31 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31) (_ bv0 1)) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_30 v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse1 v_prenex_36) (_ bv0 1))) (= v_prenex_33 (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1))) (not (= (_ bv0 1) (select v_prenex_30 v_prenex_35)))))) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_28 (_ bv0 1)))))))) (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_25) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70) (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26)) (not (= (store (store .cse2 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (select .cse2 v_prenex_27) (_ bv0 1))))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (forall ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (or (not (= (select .cse3 v_probe1_6_~p~0.base_67) (_ bv0 1))) (= (store (store .cse3 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)))))))))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-07 16:14:47,620 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)))) is different from false [2019-12-07 16:14:47,627 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1))) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))))) is different from false [2019-12-07 16:15:02,358 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (and (not (= v_prenex_25 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)))) (forall ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26))) (not (= (select .cse0 v_prenex_27) (_ bv0 1))) (= (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_70)))) (exists ((|v_entry_point_~#a7~0.base_43| (_ BitVec 32)) (v_probe1_6_~p~0.base_67 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_43| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_43|)) (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1)))))))) is different from false [2019-12-07 16:15:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:28,526 INFO L93 Difference]: Finished difference Result 59 states and 58 transitions. [2019-12-07 16:15:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 16:15:28,527 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-12-07 16:15:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:28,527 INFO L225 Difference]: With dead ends: 59 [2019-12-07 16:15:28,527 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 16:15:28,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=114, Invalid=284, Unknown=74, NotChecked=650, Total=1122 [2019-12-07 16:15:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 16:15:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 16:15:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 16:15:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2019-12-07 16:15:28,529 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 39 [2019-12-07 16:15:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:28,529 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2019-12-07 16:15:28,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 16:15:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2019-12-07 16:15:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 16:15:28,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:28,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:28,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 16:15:28,731 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:15:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash 60573377, now seen corresponding path program 1 times [2019-12-07 16:15:28,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:15:28,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882418077] [2019-12-07 16:15:28,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:15:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:28,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 16:15:28,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:15:28,909 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 16:15:28,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:15:28,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:28,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:15:28,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:15:28,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:15:28,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:15:28,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:28,973 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 16:15:28,973 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 16:15:29,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:15:29,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:15:29,019 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:29,019 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:15:29,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2019-12-07 16:15:29,035 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 16:15:29,035 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:15:29,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-12-07 16:15:29,143 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:15:29,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:29,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:15:29,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-12-07 16:15:29,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:15:29,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:15:29,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:15:29,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:15:29,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:15:29,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:15:29,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:15:29,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:15:29,507 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 16:15:29,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882418077] [2019-12-07 16:15:29,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:29,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 13 [2019-12-07 16:15:29,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6371237] [2019-12-07 16:15:29,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:15:29,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:15:29,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:15:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:15:29,509 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand 14 states. [2019-12-07 16:15:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:29,808 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2019-12-07 16:15:29,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:15:29,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-12-07 16:15:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:29,809 INFO L225 Difference]: With dead ends: 47 [2019-12-07 16:15:29,809 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 16:15:29,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 14 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:15:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 16:15:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 16:15:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 16:15:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2019-12-07 16:15:29,811 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 40 [2019-12-07 16:15:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:29,811 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2019-12-07 16:15:29,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:15:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2019-12-07 16:15:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 16:15:29,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:29,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:30,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 16:15:30,013 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, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 16:15:30,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1241521659, now seen corresponding path program 1 times [2019-12-07 16:15:30,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:15:30,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979081609] [2019-12-07 16:15:30,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/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 16:15:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:30,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 16:15:30,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:15:30,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 16:15:30,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:15:30,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:30,266 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:15:30,267 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 16:15:30,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 16:15:30,294 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:15:30,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:30,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:15:30,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 16:15:30,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:15:30,325 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:15:30,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:30,331 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 16:15:30,331 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2019-12-07 16:15:30,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:30,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 16:15:30,396 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:15:30,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:30,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:15:30,401 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:12 [2019-12-07 16:15:36,427 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2019-12-07 16:15:38,463 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 16:15:40,505 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 16:15:42,553 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 16:15:42,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:42,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2019-12-07 16:15:42,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:15:42,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:15:42,567 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:15:42,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:15:42,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:15:42,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:15:42,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:43 [2019-12-07 16:15:58,723 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 16:15:58,723 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:16:01,229 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 16:16:01,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_56|))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_31|))) is different from false [2019-12-07 16:16:12,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse0 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (forall ((v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_disconnect_6_#in~a.base| (_ bv0 1)) v_prenex_41) (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse1 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse1 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))))))) is different from false [2019-12-07 16:16:13,000 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse0 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (forall ((v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_disconnect_6_#in~a.base| (_ bv0 1)) v_prenex_41) (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse1 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse1 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))))))) is different from true [2019-12-07 16:16:13,005 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 16:16:13,007 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_41], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2019-12-07 16:16:13,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (= v_prenex_41 (store (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) is different from false [2019-12-07 16:16:13,016 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (= v_prenex_41 (store (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) is different from true [2019-12-07 16:16:13,017 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 16:16:13,019 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_41], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2019-12-07 16:16:13,020 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 16:16:13,022 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_41], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2019-12-07 16:16:13,024 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 16:16:13,025 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_41], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2019-12-07 16:16:13,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (= v_prenex_41 (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| c_disconnect_6_~a.base) c_disconnect_6_~a.offset) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) is different from false [2019-12-07 16:16:13,035 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (= v_prenex_41 (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| c_disconnect_6_~a.base) c_disconnect_6_~a.offset) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) is different from true [2019-12-07 16:16:13,036 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 16:16:13,039 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_41], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2019-12-07 16:16:13,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_41 (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))))) is different from false [2019-12-07 16:16:13,052 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_41 (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))))) is different from true [2019-12-07 16:16:13,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_entry_point_~#a7~0.base| (_ bv0 1))) (not (= (select |c_#valid| v_probe1_6_~p~0.base_84) (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_56|))))))) is different from false [2019-12-07 16:16:13,175 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,178 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))) is different from false [2019-12-07 16:16:13,188 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))) is different from true [2019-12-07 16:16:13,189 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,192 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,194 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,195 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,200 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,206 WARN L838 $PredicateComparison]: unable to prove that (forall ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (= (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset c_probe1_6_~p~0.base)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))))) is different from false [2019-12-07 16:16:13,212 WARN L860 $PredicateComparison]: unable to prove that (forall ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (= (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset c_probe1_6_~p~0.base)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))))) is different from true [2019-12-07 16:16:13,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,216 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,218 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,226 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,229 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,232 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,234 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,237 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,239 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,242 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,245 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,247 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,249 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,251 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,253 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,255 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |c_probe1_6_#t~ret40.base|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))))) is different from false [2019-12-07 16:16:13,268 WARN L860 $PredicateComparison]: unable to prove that (forall ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |c_probe1_6_#t~ret40.base|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))))) is different from true [2019-12-07 16:16:13,298 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,300 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,308 WARN L860 $PredicateComparison]: unable to prove that (forall ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_150|) (_ bv0 1))) (= (store (store (store |c_#valid| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |v_probe1_6_#t~ret40.base_150|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))))) is different from true [2019-12-07 16:16:13,313 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2019-12-07 16:16:13,419 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5870 conjuctions. This might take some time... [2019-12-07 16:16:13,438 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 12 conjuctions. [2019-12-07 16:16:13,440 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,442 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_44, v_prenex_49], 24=[v_prenex_48]} [2019-12-07 16:16:13,443 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_probe1_6_#t~ret40.base_150|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84))) (= v_prenex_44 (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45)) (= (_ bv0 1) (select .cse0 v_prenex_46)) (not (= (store (store .cse0 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_150|)) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|)))))))) (forall ((v_prenex_47 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_48 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_53 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50)) (forall ((v_prenex_55 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32))) (let ((.cse2 (store v_prenex_48 v_prenex_54 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_48 v_prenex_54))) (not (= (_ bv0 1) (select .cse2 v_prenex_55))) (= (store (store .cse2 v_prenex_55 (_ bv0 1)) v_prenex_54 (_ bv0 1)) v_prenex_53)))) (not (= v_prenex_53 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))))) (= v_prenex_49 (store (store |c_#valid| (select (select (store v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |c_ldv_malloc_#res.base|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32))) (let ((.cse3 (store v_prenex_48 v_prenex_51 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_52)) (= (_ bv0 1) (select v_prenex_48 v_prenex_51)) (not (= v_prenex_49 (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1))))))))))) is different from false [2019-12-07 16:16:13,467 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_probe1_6_#t~ret40.base_150|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84))) (= v_prenex_44 (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45)) (= (_ bv0 1) (select .cse0 v_prenex_46)) (not (= (store (store .cse0 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_150|)) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|)))))))) (forall ((v_prenex_47 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_48 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_53 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50)) (forall ((v_prenex_55 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32))) (let ((.cse2 (store v_prenex_48 v_prenex_54 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_48 v_prenex_54))) (not (= (_ bv0 1) (select .cse2 v_prenex_55))) (= (store (store .cse2 v_prenex_55 (_ bv0 1)) v_prenex_54 (_ bv0 1)) v_prenex_53)))) (not (= v_prenex_53 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))))) (= v_prenex_49 (store (store |c_#valid| (select (select (store v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |c_ldv_malloc_#res.base|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32))) (let ((.cse3 (store v_prenex_48 v_prenex_51 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_52)) (= (_ bv0 1) (select v_prenex_48 v_prenex_51)) (not (= v_prenex_49 (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1))))))))))) is different from true [2019-12-07 16:16:13,472 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2019-12-07 16:16:13,603 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6922 conjuctions. This might take some time... [2019-12-07 16:16:13,633 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 12 conjuctions. [2019-12-07 16:16:13,635 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,637 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_44, v_prenex_49], 24=[v_prenex_48]} [2019-12-07 16:16:13,638 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2019-12-07 16:16:13,800 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 8393 conjuctions. This might take some time... [2019-12-07 16:16:13,836 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 13 conjuctions. [2019-12-07 16:16:13,838 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:13,840 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_44, v_prenex_49], 24=[v_prenex_48]} [2019-12-07 16:16:13,841 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:13,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_109| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_probe1_6_#t~ret40.base_150|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84))) (= v_prenex_44 (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45)) (= (_ bv0 1) (select .cse0 v_prenex_46)) (not (= (store (store .cse0 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_150|)) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|)))))))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_109|) (_ bv0 1))) (forall ((v_prenex_47 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_48 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_53 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50)) (forall ((v_prenex_55 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32))) (let ((.cse2 (store v_prenex_48 v_prenex_54 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_48 v_prenex_54))) (not (= (_ bv0 1) (select .cse2 v_prenex_55))) (= (store (store .cse2 v_prenex_55 (_ bv0 1)) v_prenex_54 (_ bv0 1)) v_prenex_53)))) (not (= v_prenex_53 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))))) (= v_prenex_49 (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_109| (_ bv1 1)) (select (select (store v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_109|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32))) (let ((.cse3 (store v_prenex_48 v_prenex_51 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_52)) (= (_ bv0 1) (select v_prenex_48 v_prenex_51)) (not (= v_prenex_49 (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1))))))))))) is different from false [2019-12-07 16:16:13,875 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_109| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_probe1_6_#t~ret40.base_150|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84))) (= v_prenex_44 (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45)) (= (_ bv0 1) (select .cse0 v_prenex_46)) (not (= (store (store .cse0 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_150|)) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|)))))))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_109|) (_ bv0 1))) (forall ((v_prenex_47 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_48 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_53 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50)) (forall ((v_prenex_55 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32))) (let ((.cse2 (store v_prenex_48 v_prenex_54 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_48 v_prenex_54))) (not (= (_ bv0 1) (select .cse2 v_prenex_55))) (= (store (store .cse2 v_prenex_55 (_ bv0 1)) v_prenex_54 (_ bv0 1)) v_prenex_53)))) (not (= v_prenex_53 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))))) (= v_prenex_49 (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_109| (_ bv1 1)) (select (select (store v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_109|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32))) (let ((.cse3 (store v_prenex_48 v_prenex_51 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_52)) (= (_ bv0 1) (select v_prenex_48 v_prenex_51)) (not (= v_prenex_49 (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1))))))))))) is different from true [2019-12-07 16:16:13,879 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2019-12-07 16:16:14,022 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 8393 conjuctions. This might take some time... [2019-12-07 16:16:14,058 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 13 conjuctions. [2019-12-07 16:16:14,061 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:14,063 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_44, v_prenex_49], 24=[v_prenex_48]} [2019-12-07 16:16:14,065 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:14,068 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 16:16:14,070 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2019-12-07 16:16:14,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_150|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_150| (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))))) is different from false [2019-12-07 16:16:14,084 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_150|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_150| (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))))) is different from true [2019-12-07 16:16:16,928 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 16:16:16,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979081609] [2019-12-07 16:16:16,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:16,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 19] imperfect sequences [] total 33 [2019-12-07 16:16:16,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889567710] [2019-12-07 16:16:16,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 16:16:16,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:16:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 16:16:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=308, Unknown=71, NotChecked=650, Total=1122 [2019-12-07 16:16:16,929 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 34 states. [2019-12-07 16:16:50,204 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_probe1_6_~p~0.base_BEFORE_CALL_19 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_probe1_6_~p~0.base_BEFORE_CALL_19))) (forall ((v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_109| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_probe1_6_#t~ret40.base_150|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84))) (= v_prenex_44 (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45)) (= (_ bv0 1) (select .cse0 v_prenex_46)) (not (= (store (store .cse0 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_150|)) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|)))))))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_109|) (_ bv0 1))) (forall ((v_prenex_47 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_48 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_53 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50)) (forall ((v_prenex_55 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32))) (let ((.cse2 (store v_prenex_48 v_prenex_54 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_48 v_prenex_54))) (not (= (_ bv0 1) (select .cse2 v_prenex_55))) (= (store (store .cse2 v_prenex_55 (_ bv0 1)) v_prenex_54 (_ bv0 1)) v_prenex_53)))) (not (= v_prenex_53 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))))) (= v_prenex_49 (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_109| (_ bv1 1)) (select (select (store v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_109|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32))) (let ((.cse3 (store v_prenex_48 v_prenex_51 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_52)) (= (_ bv0 1) (select v_prenex_48 v_prenex_51)) (not (= v_prenex_49 (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1)))))))))))) is different from true [2019-12-07 16:16:50,216 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_109| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_probe1_6_#t~ret40.base_150|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84))) (= v_prenex_44 (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45)) (= (_ bv0 1) (select .cse0 v_prenex_46)) (not (= (store (store .cse0 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_150|)) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|)))))))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_109|) (_ bv0 1))) (forall ((v_prenex_47 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_48 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_53 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50)) (forall ((v_prenex_55 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32))) (let ((.cse2 (store v_prenex_48 v_prenex_54 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_48 v_prenex_54))) (not (= (_ bv0 1) (select .cse2 v_prenex_55))) (= (store (store .cse2 v_prenex_55 (_ bv0 1)) v_prenex_54 (_ bv0 1)) v_prenex_53)))) (not (= v_prenex_53 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))))) (= v_prenex_49 (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_109| (_ bv1 1)) (select (select (store v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_109|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32))) (let ((.cse3 (store v_prenex_48 v_prenex_51 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_52)) (= (_ bv0 1) (select v_prenex_48 v_prenex_51)) (not (= v_prenex_49 (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1)))))))))))) is different from false [2019-12-07 16:16:50,231 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_probe1_6_#t~ret40.base_150|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84))) (= v_prenex_44 (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45)) (= (_ bv0 1) (select .cse0 v_prenex_46)) (not (= (store (store .cse0 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_150|)) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|)))))))) (forall ((v_prenex_47 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_48 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_53 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50)) (forall ((v_prenex_55 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32))) (let ((.cse2 (store v_prenex_48 v_prenex_54 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_48 v_prenex_54))) (not (= (_ bv0 1) (select .cse2 v_prenex_55))) (= (store (store .cse2 v_prenex_55 (_ bv0 1)) v_prenex_54 (_ bv0 1)) v_prenex_53)))) (not (= v_prenex_53 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))))) (= v_prenex_49 (store (store |c_#valid| (select (select (store v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |c_ldv_malloc_#res.base|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32))) (let ((.cse3 (store v_prenex_48 v_prenex_51 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_52)) (= (_ bv0 1) (select v_prenex_48 v_prenex_51)) (not (= v_prenex_49 (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1))))))))))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-07 16:16:50,244 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_150| (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_150| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_probe1_6_#t~ret40.base_150|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84))) (= v_prenex_44 (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45)) (= (_ bv0 1) (select .cse0 v_prenex_46)) (not (= (store (store .cse0 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_150|)) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|)))))))) (forall ((v_prenex_47 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_48 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_53 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50)) (forall ((v_prenex_55 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32))) (let ((.cse2 (store v_prenex_48 v_prenex_54 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_48 v_prenex_54))) (not (= (_ bv0 1) (select .cse2 v_prenex_55))) (= (store (store .cse2 v_prenex_55 (_ bv0 1)) v_prenex_54 (_ bv0 1)) v_prenex_53)))) (not (= v_prenex_53 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))))) (= v_prenex_49 (store (store |c_#valid| (select (select (store v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_47 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |c_ldv_malloc_#res.base|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32))) (let ((.cse3 (store v_prenex_48 v_prenex_51 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_52)) (= (_ bv0 1) (select v_prenex_48 v_prenex_51)) (not (= v_prenex_49 (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1))))))))))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2019-12-07 16:16:50,250 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_probe1_6_#in~a.base| c_probe1_6_~a.base) (= |c_probe1_6_#in~a.offset| c_probe1_6_~a.offset) (= |c_#valid| (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |c_probe1_6_#t~ret40.base|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84))))))) is different from false [2019-12-07 16:16:50,257 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_probe1_6_#in~a.base| c_probe1_6_~a.base) (= |c_probe1_6_#in~a.offset| c_probe1_6_~a.offset) (= |c_#valid| (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |c_probe1_6_#t~ret40.base|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84))))))) is different from true [2019-12-07 16:16:50,264 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_probe1_6_#in~a.base| c_probe1_6_~a.base) (= |c_probe1_6_#in~a.offset| c_probe1_6_~a.offset) (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (forall ((|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (= (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset c_probe1_6_~p~0.base)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse1 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))))) (= |c_#valid| (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)))) is different from false [2019-12-07 16:17:02,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|))) (and (= |c_#valid| (store |c_old(#valid)| .cse0 (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| .cse0)) (forall ((|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse2 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse2 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) is different from false [2019-12-07 16:17:02,865 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|))) (and (= |c_#valid| (store |c_old(#valid)| .cse0 (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| .cse0)) (forall ((|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_entry_point_~#a7~0.base_56|))))) (exists ((v_probe1_6_~p~0.base_84 (_ BitVec 32)) (v_prenex_44 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_45 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse2 v_prenex_46))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_45))) (= (store (store .cse2 v_prenex_46 (_ bv0 1)) v_prenex_45 (_ bv0 1)) v_prenex_44)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) v_prenex_44)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)))) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) is different from true [2019-12-07 16:17:06,973 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 16:17:09,381 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_probe1_6_~p~0.base_BEFORE_CALL_19 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_probe1_6_~p~0.base_BEFORE_CALL_19))) (exists ((|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|) |v_entry_point_~#a7~0.base_BEFORE_CALL_20|))) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_41 (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1))))))))))) is different from false [2019-12-07 16:17:09,390 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_disconnect_6_#in~a.offset| c_disconnect_6_~a.offset) (= c_disconnect_6_~a.base |c_disconnect_6_#in~a.base|) (= |c_#valid| |c_old(#valid)|) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (= v_prenex_41 (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| c_disconnect_6_~a.base) c_disconnect_6_~a.offset) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) (exists ((|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|) |v_entry_point_~#a7~0.base_BEFORE_CALL_20|)))) is different from false [2019-12-07 16:17:09,400 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) |c_disconnect_6_#t~mem43.base|) (= |c_#valid| |c_old(#valid)|) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (= v_prenex_41 (store (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) (exists ((|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|) |v_entry_point_~#a7~0.base_BEFORE_CALL_20|)))) is different from false [2019-12-07 16:17:09,405 WARN L860 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) |c_disconnect_6_#t~mem43.base|) (= |c_#valid| |c_old(#valid)|) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse0 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse0 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))) (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (= v_prenex_41 (store (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) (exists ((|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|) |v_entry_point_~#a7~0.base_BEFORE_CALL_20|)))) is different from true [2019-12-07 16:17:09,411 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1))) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_56| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56| (_ bv1 1)))) (or (not (= (select .cse0 v_probe1_6_~p~0.base_81) (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_entry_point_~#a7~0.base_56|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_entry_point_~#a7~0.base_56| (_ bv0 1)))))))) (forall ((v_prenex_41 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |c_disconnect_6_#in~a.base| (_ bv0 1)) v_prenex_41) (exists ((v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_42 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_42) (_ bv0 1)) (= (select .cse1 v_prenex_43) (_ bv0 1)) (not (= v_prenex_41 (store (store .cse1 v_prenex_43 (_ bv0 1)) v_prenex_42 (_ bv0 1))))))))))) (exists ((|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|) |v_entry_point_~#a7~0.base_BEFORE_CALL_20|)))) is different from false [2019-12-07 16:17:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:21,606 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2019-12-07 16:17:21,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 16:17:21,606 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 46 [2019-12-07 16:17:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:21,606 INFO L225 Difference]: With dead ends: 46 [2019-12-07 16:17:21,606 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:17:21,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 23 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 64.1s TimeCoverageRelationStatistics Valid=155, Invalid=517, Unknown=122, NotChecked=1656, Total=2450 [2019-12-07 16:17:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:17:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:17:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:17:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:17:21,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2019-12-07 16:17:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:21,608 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:17:21,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 16:17:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:17:21,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:17:21,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 16:17:21,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:17:21 BoogieIcfgContainer [2019-12-07 16:17:21,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:17:21,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:17:21,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:17:21,820 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:17:21,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:08:25" (3/4) ... [2019-12-07 16:17:21,826 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:17:21,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-12-07 16:17:21,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 16:17:21,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-12-07 16:17:21,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 16:17:21,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-12-07 16:17:21,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 16:17:21,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f6 [2019-12-07 16:17:21,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-12-07 16:17:21,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-12-07 16:17:21,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-12-07 16:17:21,841 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g6 [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-12-07 16:17:21,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 16:17:21,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-12-07 16:17:21,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-12-07 16:17:21,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-12-07 16:17:21,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-12-07 16:17:21,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-12-07 16:17:21,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-12-07 16:17:21,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-12-07 16:17:21,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 16:17:21,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-12-07 16:17:21,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-12-07 16:17:21,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-12-07 16:17:21,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-12-07 16:17:21,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure disconnect_6 [2019-12-07 16:17:21,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure probe1_6 [2019-12-07 16:17:21,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2019-12-07 16:17:21,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 16:17:21,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:17:21,854 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:17:21,854 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 16:17:21,887 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8d65a697-552e-4d8d-a839-fb42694c68e3/bin/uautomizer/witness.graphml [2019-12-07 16:17:21,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:17:21,888 INFO L168 Benchmark]: Toolchain (without parser) took 537721.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.3 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -260.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:17:21,888 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 16:17:21,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:21,889 INFO L168 Benchmark]: Boogie Preprocessor took 63.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:17:21,889 INFO L168 Benchmark]: RCFGBuilder took 888.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 124.2 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:21,889 INFO L168 Benchmark]: TraceAbstraction took 536265.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -254.1 MB). Peak memory consumption was 286.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:21,889 INFO L168 Benchmark]: Witness Printer took 68.00 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:17:21,890 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 433.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 888.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 124.2 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 536265.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -254.1 MB). Peak memory consumption was 286.7 MB. Max. memory is 11.5 GB. * Witness Printer took 68.00 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 790]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 781]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 774]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 774]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 81 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 51 procedures, 373 locations, 81 error locations. Result: SAFE, OverallTime: 536.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 407.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 840 SDtfs, 769 SDslu, 3329 SDs, 0 SdLazy, 2128 SolverSat, 227 SolverUnsat, 194 SolverUnknown, 0 SolverNotchecked, 287.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1203 GetRequests, 893 SyntacticMatches, 48 SemanticMatches, 262 ConstructedPredicates, 52 IntricatePredicates, 2 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 237.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 92 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 122.0s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1108 ConstructedInterpolants, 227 QuantifiedInterpolants, 515159 SizeOfPredicates, 88 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...