./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-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_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e4d0785323ca2fbac076cafe34fff682fc43d2 ........................................................................................................................................ 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_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e4d0785323ca2fbac076cafe34fff682fc43d2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:16:21,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:16:21,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:16:21,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:16:21,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:16:21,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:16:21,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:16:21,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:16:21,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:16:21,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:16:21,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:16:21,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:16:21,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:16:21,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:16:21,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:16:21,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:16:21,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:16:21,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:16:21,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:16:21,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:16:21,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:16:21,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:16:21,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:16:21,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:16:21,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:16:21,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:16:21,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:16:21,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:16:21,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:16:21,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:16:21,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:16:21,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:16:21,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:16:21,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:16:21,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:16:21,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:16:21,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:16:21,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:16:21,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:16:21,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:16:21,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:16:21,774 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 14:16:21,784 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:16:21,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:16:21,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:16:21,785 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:16:21,785 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:16:21,785 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:16:21,785 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:16:21,785 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:16:21,785 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:16:21,786 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:16:21,786 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:16:21,786 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:16:21,786 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:16:21,786 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:16:21,786 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:16:21,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:16:21,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:16:21,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:16:21,787 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:16:21,787 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:16:21,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:16:21,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:16:21,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:16:21,788 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:16:21,788 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:16:21,788 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:16:21,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:16:21,788 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:16:21,788 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:16:21,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:16:21,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:16:21,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:16:21,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:16:21,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:16:21,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:16:21,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:16:21,789 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:16:21,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:16:21,789 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:16:21,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:16:21,790 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan 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 -> Taipan 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 -> 69e4d0785323ca2fbac076cafe34fff682fc43d2 [2019-12-07 14:16:21,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:16:21,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:16:21,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:16:21,900 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:16:21,900 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:16:21,900 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-12-07 14:16:21,938 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data/28096e9ff/f08a35da6e3b4e8b8fddf9688972ae86/FLAG315c627d4 [2019-12-07 14:16:22,433 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:16:22,434 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-12-07 14:16:22,444 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data/28096e9ff/f08a35da6e3b4e8b8fddf9688972ae86/FLAG315c627d4 [2019-12-07 14:16:22,453 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data/28096e9ff/f08a35da6e3b4e8b8fddf9688972ae86 [2019-12-07 14:16:22,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:16:22,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:16:22,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:16:22,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:16:22,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:16:22,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:16:22" (1/1) ... [2019-12-07 14:16:22,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3482028c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:22, skipping insertion in model container [2019-12-07 14:16:22,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:16:22" (1/1) ... [2019-12-07 14:16:22,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:16:22,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:16:22,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:16:22,711 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-12-07 14:16:22,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@8d0cc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:22, skipping insertion in model container [2019-12-07 14:16:22,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:16:22,712 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 14:16:22,713 INFO L168 Benchmark]: Toolchain (without parser) took 257.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:16:22,714 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:16:22,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:16:22,716 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 518]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:16:23,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:16:23,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:16:23,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:16:23,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:16:23,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:16:23,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:16:23,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:16:23,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:16:23,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:16:23,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:16:23,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:16:23,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:16:23,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:16:23,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:16:23,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:16:23,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:16:23,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:16:23,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:16:23,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:16:23,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:16:23,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:16:23,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:16:23,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:16:23,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:16:23,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:16:23,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:16:23,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:16:23,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:16:23,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:16:23,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:16:23,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:16:23,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:16:23,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:16:23,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:16:23,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:16:23,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:16:23,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:16:23,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:16:23,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:16:23,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:16:23,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 14:16:23,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:16:23,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:16:23,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:16:23,905 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:16:23,905 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:16:23,905 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:16:23,905 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:16:23,905 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:16:23,905 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:16:23,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:16:23,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:16:23,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:16:23,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:16:23,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:16:23,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:16:23,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:16:23,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:16:23,907 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:16:23,907 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:16:23,907 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:16:23,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:16:23,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:16:23,907 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:16:23,907 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:16:23,908 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:16:23,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:16:23,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:16:23,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:16:23,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:16:23,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:16:23,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:16:23,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:16:23,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:16:23,909 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 14:16:23,909 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:16:23,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:16:23,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:16:23,909 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_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan 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 -> Taipan 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 -> 69e4d0785323ca2fbac076cafe34fff682fc43d2 [2019-12-07 14:16:24,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:16:24,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:16:24,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:16:24,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:16:24,086 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:16:24,086 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-12-07 14:16:24,125 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data/d3fea8252/a5b278016844474fb5033e01adfdbf5d/FLAGb6782d9d1 [2019-12-07 14:16:24,563 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:16:24,563 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-12-07 14:16:24,573 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data/d3fea8252/a5b278016844474fb5033e01adfdbf5d/FLAGb6782d9d1 [2019-12-07 14:16:24,919 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/data/d3fea8252/a5b278016844474fb5033e01adfdbf5d [2019-12-07 14:16:24,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:16:24,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:16:24,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:16:24,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:16:24,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:16:24,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:16:24" (1/1) ... [2019-12-07 14:16:24,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4400293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:24, skipping insertion in model container [2019-12-07 14:16:24,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:16:24" (1/1) ... [2019-12-07 14:16:24,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:16:24,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:16:25,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:16:25,191 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 14:16:25,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:16:25,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:16:25,220 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:16:25,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:16:25,282 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:16:25,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25 WrapperNode [2019-12-07 14:16:25,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:16:25,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:16:25,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:16:25,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:16:25,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:16:25,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:16:25,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:16:25,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:16:25,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... [2019-12-07 14:16:25,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:16:25,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:16:25,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:16:25,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:16:25,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:16:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:16:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:16:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:16:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:16:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:16:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:16:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:16:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:16:25,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:16:25,714 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:16:25,715 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:16:25,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:16:25 BoogieIcfgContainer [2019-12-07 14:16:25,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:16:25,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:16:25,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:16:25,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:16:25,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:16:24" (1/3) ... [2019-12-07 14:16:25,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c587c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:16:25, skipping insertion in model container [2019-12-07 14:16:25,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:16:25" (2/3) ... [2019-12-07 14:16:25,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c587c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:16:25, skipping insertion in model container [2019-12-07 14:16:25,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:16:25" (3/3) ... [2019-12-07 14:16:25,720 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-2.i [2019-12-07 14:16:25,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:16:25,732 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-12-07 14:16:25,739 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-12-07 14:16:25,751 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:16:25,751 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:16:25,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:16:25,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:16:25,752 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:16:25,752 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:16:25,752 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:16:25,752 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:16:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-12-07 14:16:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:16:25,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:25,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:16:25,768 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:16:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-12-07 14:16:25,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:16:25,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029309090] [2019-12-07 14:16:25,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:16:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:25,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:16:25,828 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:25,880 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:16:25,881 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:16:25,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:25,886 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:25,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:25,887 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 14:16:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:25,899 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:16:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:25,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029309090] [2019-12-07 14:16:25,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:25,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:16:25,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094446576] [2019-12-07 14:16:25,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:16:25,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:16:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:16:25,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:16:25,922 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-12-07 14:16:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:26,051 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-12-07 14:16:26,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:16:26,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:16:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:26,059 INFO L225 Difference]: With dead ends: 64 [2019-12-07 14:16:26,059 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 14:16:26,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:16:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 14:16:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 14:16:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 14:16:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-12-07 14:16:26,086 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 3 [2019-12-07 14:16:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:26,087 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-12-07 14:16:26,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:16:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-12-07 14:16:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:16:26,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:26,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:16:26,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:16:26,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:16:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:26,290 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 14:16:26,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:16:26,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985070969] [2019-12-07 14:16:26,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:16:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:26,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:16:26,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:26,377 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_37|], 1=[|v_#valid_53|]} [2019-12-07 14:16:26,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:16:26,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:16:26,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:26,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:26,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:16:26,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:16:26,403 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:26,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:26,412 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:26,413 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-12-07 14:16:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:26,425 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:16:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:26,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985070969] [2019-12-07 14:16:26,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:26,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 14:16:26,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898140762] [2019-12-07 14:16:26,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:16:26,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:16:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:16:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:26,476 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 4 states. [2019-12-07 14:16:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:26,704 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-12-07 14:16:26,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:16:26,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 14:16:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:26,706 INFO L225 Difference]: With dead ends: 60 [2019-12-07 14:16:26,706 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 14:16:26,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:26,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 14:16:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-07 14:16:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 14:16:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-12-07 14:16:26,712 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 3 [2019-12-07 14:16:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:26,712 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-12-07 14:16:26,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:16:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-12-07 14:16:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:16:26,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:26,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:16:26,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:16:26,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:16:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2019-12-07 14:16:26,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:16:26,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034232407] [2019-12-07 14:16:26,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:16:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:26,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:16:26,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:27,002 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_39|], 1=[|v_#valid_55|]} [2019-12-07 14:16:27,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:16:27,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:16:27,007 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:27,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:27,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:16:27,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 14:16:27,026 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:27,035 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:27,035 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:27,036 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-12-07 14:16:27,067 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_56|], 3=[|v_#length_40|]} [2019-12-07 14:16:27,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:27,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:16:27,079 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:27,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:27,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:27,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-12-07 14:16:27,117 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:27,143 INFO L614 ElimStorePlain]: treesize reduction 28, result has 40.4 percent of original size [2019-12-07 14:16:27,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:27,144 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-12-07 14:16:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:27,149 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:16:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:27,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:27,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:16:27,263 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:27,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:27,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:16:27,283 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:27,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:27,309 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:16:27,309 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2019-12-07 14:16:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:27,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034232407] [2019-12-07 14:16:27,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:27,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 14:16:27,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102016969] [2019-12-07 14:16:27,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:16:27,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:16:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:16:27,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:16:27,348 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 6 states. [2019-12-07 14:16:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:27,733 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-12-07 14:16:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:16:27,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-12-07 14:16:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:27,735 INFO L225 Difference]: With dead ends: 58 [2019-12-07 14:16:27,736 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 14:16:27,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:16:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 14:16:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-07 14:16:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 14:16:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-12-07 14:16:27,742 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 5 [2019-12-07 14:16:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:27,742 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-12-07 14:16:27,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:16:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-12-07 14:16:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:16:27,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:27,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:27,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:16:27,945 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:16:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024997, now seen corresponding path program 1 times [2019-12-07 14:16:27,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:16:27,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48047311] [2019-12-07 14:16:27,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:16:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:28,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:16:28,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:28,034 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:16:28,035 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:16:28,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:28,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:28,039 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:28,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 14:16:28,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:16:28,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:28,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:28,056 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:28,056 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 14:16:28,084 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:28,085 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 21 treesize of output 59 [2019-12-07 14:16:28,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:28,105 INFO L614 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2019-12-07 14:16:28,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:28,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:23 [2019-12-07 14:16:28,134 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-12-07 14:16:28,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-12-07 14:16:28,136 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:28,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:28,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:28,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2019-12-07 14:16:28,174 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 14:16:28,174 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 42 treesize of output 18 [2019-12-07 14:16:28,175 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:28,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:28,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:28,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:17 [2019-12-07 14:16:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:28,203 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:16:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:28,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48047311] [2019-12-07 14:16:28,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:28,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-12-07 14:16:28,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300043473] [2019-12-07 14:16:28,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:16:28,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:16:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:16:28,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:16:28,267 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 10 states. [2019-12-07 14:16:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:28,915 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-12-07 14:16:28,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:16:28,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-12-07 14:16:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:28,916 INFO L225 Difference]: With dead ends: 57 [2019-12-07 14:16:28,916 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 14:16:28,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:16:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 14:16:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 14:16:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 14:16:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-12-07 14:16:28,921 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 7 [2019-12-07 14:16:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:28,921 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-12-07 14:16:28,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:16:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-12-07 14:16:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:16:28,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:28,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:29,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:16:29,124 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:16:29,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024998, now seen corresponding path program 1 times [2019-12-07 14:16:29,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:16:29,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281177246] [2019-12-07 14:16:29,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:16:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:29,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:16:29,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:29,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 14:16:29,244 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,271 INFO L614 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2019-12-07 14:16:29,282 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:16:29,282 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:16:29,282 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:29,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:29,296 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:28 [2019-12-07 14:16:29,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:29,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:16:29,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,341 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:16:29,345 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,354 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:28 [2019-12-07 14:16:29,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,377 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 15 treesize of output 19 [2019-12-07 14:16:29,377 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,390 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 18 treesize of output 20 [2019-12-07 14:16:29,391 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,404 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,404 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:30 [2019-12-07 14:16:29,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:16:29,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2019-12-07 14:16:29,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:16:29,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 26 [2019-12-07 14:16:29,463 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,482 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,482 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:46 [2019-12-07 14:16:29,510 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-12-07 14:16:29,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 14:16:29,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:29,527 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,530 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 14:16:29,531 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 46 treesize of output 22 [2019-12-07 14:16:29,532 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:29,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:29,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:16:29,539 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:20 [2019-12-07 14:16:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:29,560 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:16:29,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:29,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281177246] [2019-12-07 14:16:29,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:29,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-12-07 14:16:29,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882912896] [2019-12-07 14:16:29,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:16:29,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:16:29,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:16:29,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:16:29,847 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 11 states. [2019-12-07 14:16:30,341 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-12-07 14:16:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:34,827 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-12-07 14:16:34,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:16:34,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-12-07 14:16:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:34,828 INFO L225 Difference]: With dead ends: 57 [2019-12-07 14:16:34,828 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 14:16:34,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:16:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 14:16:34,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-12-07 14:16:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 14:16:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-12-07 14:16:34,832 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 7 [2019-12-07 14:16:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:34,832 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-12-07 14:16:34,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:16:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-12-07 14:16:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:16:34,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:34,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:35,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:16:35,034 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:16:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1056667984, now seen corresponding path program 1 times [2019-12-07 14:16:35,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:16:35,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330562237] [2019-12-07 14:16:35,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:16:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:35,142 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:16:35,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:35,147 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 10 treesize of output 8 [2019-12-07 14:16:35,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:35,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:35,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:35,150 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-12-07 14:16:35,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:16:35,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:35,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:35,160 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:35,161 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 14:16:35,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:16:35,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:35,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:35,173 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:35,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 14:16:35,194 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-12-07 14:16:35,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-12-07 14:16:35,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:16:35,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:16:35,206 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:16:35,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2019-12-07 14:18:14,688 WARN L192 SmtUtils]: Spent 1.66 m on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2019-12-07 14:18:14,688 INFO L343 Elim1Store]: treesize reduction 343, result has 48.0 percent of original size [2019-12-07 14:18:14,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 343 [2019-12-07 14:18:14,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:14,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:14,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:15,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:18:15,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-12-07 14:18:18,879 WARN L192 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 381 DAG size of output: 15 [2019-12-07 14:18:18,880 INFO L614 ElimStorePlain]: treesize reduction 118994, result has 0.0 percent of original size [2019-12-07 14:18:18,880 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:18,880 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:92, output treesize:20 [2019-12-07 14:18:18,885 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 14:18:18,885 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 29 treesize of output 13 [2019-12-07 14:18:18,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:18,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:18,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:18,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 14:18:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:18,897 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:18,917 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:18:18,947 INFO L614 ElimStorePlain]: treesize reduction 83, result has 30.3 percent of original size [2019-12-07 14:18:18,947 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 14:18:18,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:36 [2019-12-07 14:18:20,491 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 14:18:20,886 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 217 treesize of output 148 [2019-12-07 14:18:20,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:20,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:20,897 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 14:18:20,898 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:77, output treesize:70 [2019-12-07 14:18:27,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330562237] [2019-12-07 14:18:27,527 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 14:18:27,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1452906826] [2019-12-07 14:18:27,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:18:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:27,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:18:27,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:27,628 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4b3ee1dc [2019-12-07 14:18:27,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942550018] [2019-12-07 14:18:27,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c86c5d7-b048-4d41-a849-8dc822f7b6e7/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:27,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:18:27,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:27,686 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4b3ee1dc [2019-12-07 14:18:27,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:27,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 14:18:27,687 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 14:18:27,687 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:18:28,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:18:28,304 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 14:18:28,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:18:28 BoogieIcfgContainer [2019-12-07 14:18:28,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:18:28,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:18:28,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:18:28,304 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:18:28,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:16:25" (3/4) ... [2019-12-07 14:18:28,307 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:18:28,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:18:28,308 INFO L168 Benchmark]: Toolchain (without parser) took 123380.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 947.0 MB in the beginning and 977.9 MB in the end (delta: -30.9 MB). Peak memory consumption was 191.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:28,308 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:28,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:28,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:28,309 INFO L168 Benchmark]: Boogie Preprocessor took 23.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:28,309 INFO L168 Benchmark]: RCFGBuilder took 373.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:28,310 INFO L168 Benchmark]: TraceAbstraction took 122587.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 84.0 MB). Peak memory consumption was 181.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:28,310 INFO L168 Benchmark]: Witness Printer took 2.56 ms. Allocated memory is still 1.3 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:28,311 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.13 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 353.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.99 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. * Boogie Preprocessor took 23.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 373.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 122587.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 84.0 MB). Peak memory consumption was 181.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.56 ms. Allocated memory is still 1.3 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L533] TData data; [L518] pdata->lo = (int *)malloc(sizeof(int)) [L519] pdata->hi = (int *)malloc(sizeof(int)) [L520] EXPR pdata->lo [L520] *(pdata->lo) = 4 [L521] EXPR pdata->hi [L521] *(pdata->hi) = 8 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 35 error locations. Result: UNKNOWN, OverallTime: 122.5s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 138 SDtfs, 276 SDslu, 233 SDs, 0 SdLazy, 564 SolverSat, 36 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 40 ConstructedInterpolants, 11 QuantifiedInterpolants, 3262 SizeOfPredicates, 43 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...