./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3d056a1f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:53:43,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:53:43,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:53:43,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:53:43,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:53:43,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:53:43,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:53:43,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:53:43,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:53:43,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:53:43,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:53:43,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:53:43,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:53:43,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:53:43,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:53:43,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:53:43,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:53:43,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:53:43,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:53:43,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:53:43,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:53:43,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:53:43,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:53:43,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:53:43,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:53:43,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:53:43,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:53:43,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:53:43,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:53:43,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:53:43,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:53:43,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:53:43,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:53:43,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:53:43,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:53:43,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:53:43,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:53:43,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:53:43,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:53:43,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:53:43,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:53:43,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 13:53:43,713 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:53:43,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:53:43,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:53:43,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:53:43,715 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:53:43,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:53:43,715 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:53:43,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:53:43,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:53:43,716 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:53:43,716 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:53:43,716 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:53:43,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:53:43,717 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:53:43,717 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:53:43,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:53:43,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:53:43,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:53:43,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:53:43,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:53:43,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:53:43,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:53:43,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:53:43,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:53:43,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2019-11-22 13:53:44,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:53:44,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:53:44,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:53:44,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:53:44,091 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:53:44,091 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 13:53:44,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cbee1b37/3ba7582a04004646b804ae5a4bd7c8b4/FLAGbd877352e [2019-11-22 13:53:44,650 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:53:44,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 13:53:44,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cbee1b37/3ba7582a04004646b804ae5a4bd7c8b4/FLAGbd877352e [2019-11-22 13:53:44,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cbee1b37/3ba7582a04004646b804ae5a4bd7c8b4 [2019-11-22 13:53:44,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:53:44,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:53:44,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:53:44,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:53:44,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:53:44,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:53:44" (1/1) ... [2019-11-22 13:53:45,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3312ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:44, skipping insertion in model container [2019-11-22 13:53:45,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:53:44" (1/1) ... [2019-11-22 13:53:45,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:53:45,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:53:45,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:53:45,524 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:53:45,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:53:45,654 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:53:45,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45 WrapperNode [2019-11-22 13:53:45,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:53:45,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:53:45,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:53:45,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:53:45,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (1/1) ... [2019-11-22 13:53:45,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (1/1) ... [2019-11-22 13:53:45,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (1/1) ... [2019-11-22 13:53:45,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (1/1) ... [2019-11-22 13:53:45,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (1/1) ... [2019-11-22 13:53:45,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (1/1) ... [2019-11-22 13:53:45,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (1/1) ... [2019-11-22 13:53:45,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:53:45,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:53:45,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:53:45,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:53:45,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-22 13:53:45,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:53:45,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:53:45,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 13:53:45,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 13:53:45,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 13:53:45,813 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 13:53:45,813 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 13:53:45,814 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 13:53:45,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:53:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 13:53:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 13:53:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 13:53:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 13:53:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 13:53:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 13:53:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 13:53:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 13:53:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 13:53:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 13:53:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 13:53:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 13:53:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 13:53:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 13:53:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 13:53:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 13:53:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 13:53:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 13:53:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 13:53:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 13:53:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 13:53:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 13:53:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 13:53:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 13:53:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 13:53:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 13:53:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 13:53:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 13:53:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 13:53:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 13:53:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 13:53:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 13:53:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 13:53:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 13:53:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 13:53:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 13:53:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 13:53:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 13:53:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 13:53:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 13:53:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 13:53:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 13:53:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 13:53:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 13:53:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 13:53:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 13:53:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 13:53:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 13:53:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 13:53:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 13:53:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 13:53:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 13:53:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 13:53:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:53:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 13:53:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:53:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 13:53:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 13:53:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 13:53:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 13:53:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 13:53:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 13:53:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 13:53:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 13:53:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 13:53:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 13:53:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 13:53:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 13:53:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 13:53:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 13:53:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 13:53:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 13:53:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 13:53:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 13:53:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 13:53:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 13:53:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 13:53:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 13:53:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 13:53:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 13:53:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 13:53:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 13:53:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 13:53:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 13:53:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 13:53:45,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 13:53:45,834 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 13:53:45,834 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 13:53:45,834 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 13:53:45,834 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 13:53:45,834 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 13:53:45,834 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 13:53:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 13:53:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 13:53:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 13:53:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 13:53:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 13:53:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 13:53:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 13:53:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 13:53:45,836 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 13:53:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 13:53:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 13:53:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 13:53:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 13:53:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 13:53:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 13:53:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 13:53:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 13:53:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 13:53:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 13:53:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 13:53:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 13:53:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 13:53:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 13:53:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 13:53:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 13:53:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 13:53:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 13:53:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 13:53:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 13:53:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 13:53:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 13:53:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 13:53:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 13:53:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 13:53:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 13:53:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 13:53:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 13:53:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 13:53:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 13:53:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 13:53:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 13:53:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 13:53:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 13:53:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 13:53:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 13:53:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 13:53:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 13:53:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 13:53:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 13:53:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 13:53:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 13:53:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 13:53:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 13:53:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 13:53:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 13:53:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 13:53:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 13:53:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 13:53:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 13:53:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:53:45,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:53:45,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:53:45,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:53:45,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-22 13:53:45,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 13:53:45,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:53:45,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 13:53:45,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 13:53:46,549 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:53:46,550 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 13:53:46,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:46 BoogieIcfgContainer [2019-11-22 13:53:46,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:53:46,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:53:46,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:53:46,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:53:46,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:53:44" (1/3) ... [2019-11-22 13:53:46,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3521e5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:53:46, skipping insertion in model container [2019-11-22 13:53:46,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:45" (2/3) ... [2019-11-22 13:53:46,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3521e5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:53:46, skipping insertion in model container [2019-11-22 13:53:46,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:46" (3/3) ... [2019-11-22 13:53:46,564 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-22 13:53:46,579 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:53:46,587 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 13:53:46,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 13:53:46,621 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:53:46,621 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 13:53:46,621 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:53:46,621 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:53:46,622 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:53:46,622 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:53:46,622 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:53:46,622 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:53:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 13:53:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 13:53:46,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:53:46,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:53:46,656 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:53:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:53:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989328, now seen corresponding path program 1 times [2019-11-22 13:53:46,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:53:46,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937895661] [2019-11-22 13:53:46,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:53:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:47,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937895661] [2019-11-22 13:53:47,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:53:47,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 13:53:47,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443207401] [2019-11-22 13:53:47,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:53:47,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:53:47,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:53:47,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:53:47,165 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-22 13:53:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:53:47,744 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-11-22 13:53:47,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:53:47,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-22 13:53:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:53:47,760 INFO L225 Difference]: With dead ends: 105 [2019-11-22 13:53:47,761 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 13:53:47,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:53:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 13:53:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-11-22 13:53:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-22 13:53:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2019-11-22 13:53:47,836 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 9 [2019-11-22 13:53:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:53:47,836 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2019-11-22 13:53:47,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:53:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2019-11-22 13:53:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 13:53:47,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:53:47,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:53:47,840 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:53:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:53:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989329, now seen corresponding path program 1 times [2019-11-22 13:53:47,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:53:47,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253883734] [2019-11-22 13:53:47,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:53:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:48,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253883734] [2019-11-22 13:53:48,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:53:48,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 13:53:48,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432112110] [2019-11-22 13:53:48,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:53:48,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:53:48,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:53:48,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:53:48,090 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand 6 states. [2019-11-22 13:53:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:53:48,992 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2019-11-22 13:53:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:53:48,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 13:53:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:53:48,996 INFO L225 Difference]: With dead ends: 176 [2019-11-22 13:53:48,996 INFO L226 Difference]: Without dead ends: 176 [2019-11-22 13:53:48,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:53:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-22 13:53:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2019-11-22 13:53:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-22 13:53:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2019-11-22 13:53:49,023 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 9 [2019-11-22 13:53:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:53:49,023 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2019-11-22 13:53:49,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:53:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2019-11-22 13:53:49,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 13:53:49,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:53:49,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:53:49,025 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:53:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:53:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1859028932, now seen corresponding path program 1 times [2019-11-22 13:53:49,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:53:49,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170214052] [2019-11-22 13:53:49,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:53:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:49,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170214052] [2019-11-22 13:53:49,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:53:49,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 13:53:49,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177725044] [2019-11-22 13:53:49,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:53:49,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:53:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:53:49,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:53:49,400 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand 6 states. [2019-11-22 13:53:49,655 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-22 13:53:49,802 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-11-22 13:53:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:53:50,677 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-11-22 13:53:50,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:53:50,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-22 13:53:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:53:50,682 INFO L225 Difference]: With dead ends: 270 [2019-11-22 13:53:50,682 INFO L226 Difference]: Without dead ends: 270 [2019-11-22 13:53:50,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:53:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-22 13:53:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 219. [2019-11-22 13:53:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-22 13:53:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2019-11-22 13:53:50,714 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 10 [2019-11-22 13:53:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:53:50,714 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2019-11-22 13:53:50,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:53:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2019-11-22 13:53:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 13:53:50,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:53:50,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:53:50,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:53:50,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:53:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1795322128, now seen corresponding path program 1 times [2019-11-22 13:53:50,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:53:50,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842341382] [2019-11-22 13:53:50,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:53:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:51,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842341382] [2019-11-22 13:53:51,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:53:51,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 13:53:51,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900857936] [2019-11-22 13:53:51,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:53:51,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:53:51,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:53:51,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:53:51,026 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand 6 states. [2019-11-22 13:53:51,298 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-22 13:53:51,474 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-11-22 13:53:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:53:52,313 INFO L93 Difference]: Finished difference Result 256 states and 361 transitions. [2019-11-22 13:53:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 13:53:52,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-22 13:53:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:53:52,317 INFO L225 Difference]: With dead ends: 256 [2019-11-22 13:53:52,317 INFO L226 Difference]: Without dead ends: 256 [2019-11-22 13:53:52,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:53:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-22 13:53:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2019-11-22 13:53:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-22 13:53:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 322 transitions. [2019-11-22 13:53:52,364 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 322 transitions. Word has length 11 [2019-11-22 13:53:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:53:52,364 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 322 transitions. [2019-11-22 13:53:52,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:53:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 322 transitions. [2019-11-22 13:53:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 13:53:52,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:53:52,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:53:52,367 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:53:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:53:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash -179588794, now seen corresponding path program 1 times [2019-11-22 13:53:52,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:53:52,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614260721] [2019-11-22 13:53:52,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:53:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:52,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614260721] [2019-11-22 13:53:52,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:53:52,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:53:52,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310693550] [2019-11-22 13:53:52,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:53:52,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:53:52,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:53:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:53:52,527 INFO L87 Difference]: Start difference. First operand 219 states and 322 transitions. Second operand 7 states. [2019-11-22 13:53:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:53:53,545 INFO L93 Difference]: Finished difference Result 290 states and 395 transitions. [2019-11-22 13:53:53,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:53:53,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-22 13:53:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:53:53,550 INFO L225 Difference]: With dead ends: 290 [2019-11-22 13:53:53,551 INFO L226 Difference]: Without dead ends: 290 [2019-11-22 13:53:53,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:53:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-22 13:53:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 254. [2019-11-22 13:53:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-22 13:53:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-22 13:53:53,579 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 12 [2019-11-22 13:53:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:53:53,579 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-22 13:53:53,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:53:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-22 13:53:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 13:53:53,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:53:53,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:53:53,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:53:53,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:53:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1272285230, now seen corresponding path program 1 times [2019-11-22 13:53:53,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:53:53,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649895642] [2019-11-22 13:53:53,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:53:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:53,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649895642] [2019-11-22 13:53:53,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:53:53,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:53:53,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761063089] [2019-11-22 13:53:53,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:53:53,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:53:53,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:53:53,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:53:53,860 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 7 states. [2019-11-22 13:53:54,111 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-22 13:53:54,310 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-22 13:53:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:53:54,972 INFO L93 Difference]: Finished difference Result 280 states and 383 transitions. [2019-11-22 13:53:54,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:53:54,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-22 13:53:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:53:54,976 INFO L225 Difference]: With dead ends: 280 [2019-11-22 13:53:54,977 INFO L226 Difference]: Without dead ends: 280 [2019-11-22 13:53:54,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:53:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-22 13:53:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 254. [2019-11-22 13:53:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-22 13:53:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-22 13:53:54,994 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 13 [2019-11-22 13:53:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:53:54,994 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-22 13:53:54,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:53:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-22 13:53:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 13:53:54,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:53:54,995 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:53:54,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:53:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:53:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash 668439832, now seen corresponding path program 1 times [2019-11-22 13:53:54,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:53:54,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526086006] [2019-11-22 13:53:54,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:53:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:55,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526086006] [2019-11-22 13:53:55,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434581800] [2019-11-22 13:53:55,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:53:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:55,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:53:55,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:53:55,616 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 13:53:55,618 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 13:53:55,618 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 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:53:55,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:53:55,716 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 13:53:55,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:53:55,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 13:53:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:55,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:53:55,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-11-22 13:53:55,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850989984] [2019-11-22 13:53:55,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:53:55,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:53:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:53:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:53:55,786 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 10 states. [2019-11-22 13:53:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:53:56,805 INFO L93 Difference]: Finished difference Result 301 states and 422 transitions. [2019-11-22 13:53:56,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:53:56,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-22 13:53:56,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:53:56,808 INFO L225 Difference]: With dead ends: 301 [2019-11-22 13:53:56,808 INFO L226 Difference]: Without dead ends: 301 [2019-11-22 13:53:56,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-22 13:53:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-22 13:53:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 257. [2019-11-22 13:53:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-22 13:53:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 367 transitions. [2019-11-22 13:53:56,823 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 367 transitions. Word has length 17 [2019-11-22 13:53:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:53:56,824 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 367 transitions. [2019-11-22 13:53:56,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:53:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 367 transitions. [2019-11-22 13:53:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 13:53:56,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:53:56,825 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:53:57,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:53:57,034 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:53:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:53:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash -753201699, now seen corresponding path program 1 times [2019-11-22 13:53:57,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:53:57,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495617050] [2019-11-22 13:53:57,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:53:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:53:57,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495617050] [2019-11-22 13:53:57,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889090042] [2019-11-22 13:53:57,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:53:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:53:57,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-22 13:53:57,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:53:57,859 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2019-11-22 13:53:57,863 INFO L343 Elim1Store]: treesize reduction 487, result has 22.1 percent of original size [2019-11-22 13:53:57,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 324 treesize of output 420 [2019-11-22 13:53:57,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:57,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:53:58,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:53:58,719 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 61 [2019-11-22 13:53:58,721 INFO L567 ElimStorePlain]: treesize reduction 12278, result has 1.1 percent of original size [2019-11-22 13:53:58,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:53:58,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:53:58,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:120, output treesize:134 [2019-11-22 13:53:58,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:53:58,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:53:58,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:53:59,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:53:59,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:53:59,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:53:59,706 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-22 13:54:00,718 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-22 13:54:00,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:54:00,773 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 98 treesize of output 74 [2019-11-22 13:54:00,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:00,924 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-22 13:54:00,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:00,934 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 105 treesize of output 77 [2019-11-22 13:54:00,935 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:01,062 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-22 13:54:01,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:01,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2019-11-22 13:54:01,073 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:01,218 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-22 13:54:01,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:01,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 3 xjuncts. [2019-11-22 13:54:01,221 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 17 variables, input treesize:307, output treesize:222 [2019-11-22 13:54:01,492 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-22 13:54:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:01,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:54:01,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2019-11-22 13:54:01,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764044220] [2019-11-22 13:54:01,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-22 13:54:01,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-22 13:54:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-22 13:54:01,507 INFO L87 Difference]: Start difference. First operand 257 states and 367 transitions. Second operand 15 states. [2019-11-22 13:54:01,903 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-22 13:54:02,553 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 178 [2019-11-22 13:54:02,865 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-11-22 13:54:05,634 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 229 DAG size of output: 178 [2019-11-22 13:54:06,149 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-11-22 13:54:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:08,226 INFO L93 Difference]: Finished difference Result 320 states and 444 transitions. [2019-11-22 13:54:08,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 13:54:08,227 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-22 13:54:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:08,230 INFO L225 Difference]: With dead ends: 320 [2019-11-22 13:54:08,230 INFO L226 Difference]: Without dead ends: 320 [2019-11-22 13:54:08,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-22 13:54:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-22 13:54:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-11-22 13:54:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-22 13:54:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 374 transitions. [2019-11-22 13:54:08,246 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 374 transitions. Word has length 18 [2019-11-22 13:54:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:08,246 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 374 transitions. [2019-11-22 13:54:08,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-22 13:54:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 374 transitions. [2019-11-22 13:54:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 13:54:08,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:08,248 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:08,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:54:08,452 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:54:08,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:08,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1874416105, now seen corresponding path program 1 times [2019-11-22 13:54:08,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:08,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223147690] [2019-11-22 13:54:08,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:08,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223147690] [2019-11-22 13:54:08,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33446592] [2019-11-22 13:54:08,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:54:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:09,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 13:54:09,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:54:09,044 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 23=[|v_#valid_49|]} [2019-11-22 13:54:09,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,092 INFO L343 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2019-11-22 13:54:09,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2019-11-22 13:54:09,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:09,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:09,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:09,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:09,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 223 [2019-11-22 13:54:09,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:09,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:09,574 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-22 13:54:09,575 INFO L567 ElimStorePlain]: treesize reduction 1486, result has 6.2 percent of original size [2019-11-22 13:54:09,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 13:54:09,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:135, output treesize:99 [2019-11-22 13:54:09,850 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 41 treesize of output 21 [2019-11-22 13:54:09,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:09,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:09,892 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-11-22 13:54:09,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:09,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:09,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:54:09,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:66 [2019-11-22 13:54:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:09,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:54:09,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2019-11-22 13:54:09,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882902749] [2019-11-22 13:54:09,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 13:54:09,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:09,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 13:54:09,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-22 13:54:09,973 INFO L87 Difference]: Start difference. First operand 263 states and 374 transitions. Second operand 14 states. [2019-11-22 13:54:10,338 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-11-22 13:54:10,587 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-22 13:54:10,907 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-22 13:54:11,493 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-11-22 13:54:11,908 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-11-22 13:54:12,482 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-11-22 13:54:12,970 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-11-22 13:54:13,503 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-11-22 13:54:13,882 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-11-22 13:54:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:14,717 INFO L93 Difference]: Finished difference Result 310 states and 433 transitions. [2019-11-22 13:54:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 13:54:14,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-22 13:54:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:14,720 INFO L225 Difference]: With dead ends: 310 [2019-11-22 13:54:14,720 INFO L226 Difference]: Without dead ends: 310 [2019-11-22 13:54:14,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-11-22 13:54:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-22 13:54:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-11-22 13:54:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-22 13:54:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 371 transitions. [2019-11-22 13:54:14,733 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 371 transitions. Word has length 19 [2019-11-22 13:54:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:14,733 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 371 transitions. [2019-11-22 13:54:14,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 13:54:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 371 transitions. [2019-11-22 13:54:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 13:54:14,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:14,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:14,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:54:14,947 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:54:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash 550421903, now seen corresponding path program 1 times [2019-11-22 13:54:14,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:14,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046346912] [2019-11-22 13:54:14,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:15,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046346912] [2019-11-22 13:54:15,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:15,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 13:54:15,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366918361] [2019-11-22 13:54:15,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:54:15,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:15,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:54:15,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:54:15,041 INFO L87 Difference]: Start difference. First operand 263 states and 371 transitions. Second operand 4 states. [2019-11-22 13:54:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:15,335 INFO L93 Difference]: Finished difference Result 262 states and 369 transitions. [2019-11-22 13:54:15,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:54:15,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-22 13:54:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:15,338 INFO L225 Difference]: With dead ends: 262 [2019-11-22 13:54:15,338 INFO L226 Difference]: Without dead ends: 262 [2019-11-22 13:54:15,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:54:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-22 13:54:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-11-22 13:54:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-22 13:54:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2019-11-22 13:54:15,349 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 23 [2019-11-22 13:54:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:15,349 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2019-11-22 13:54:15,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:54:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2019-11-22 13:54:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 13:54:15,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:15,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:15,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:54:15,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash -116790132, now seen corresponding path program 1 times [2019-11-22 13:54:15,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:15,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12824053] [2019-11-22 13:54:15,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:15,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12824053] [2019-11-22 13:54:15,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:15,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 13:54:15,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126296448] [2019-11-22 13:54:15,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:54:15,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:15,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:54:15,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:54:15,446 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 4 states. [2019-11-22 13:54:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:15,694 INFO L93 Difference]: Finished difference Result 195 states and 262 transitions. [2019-11-22 13:54:15,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:54:15,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 13:54:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:15,696 INFO L225 Difference]: With dead ends: 195 [2019-11-22 13:54:15,697 INFO L226 Difference]: Without dead ends: 195 [2019-11-22 13:54:15,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:54:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-22 13:54:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2019-11-22 13:54:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-22 13:54:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2019-11-22 13:54:15,709 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 24 [2019-11-22 13:54:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:15,710 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2019-11-22 13:54:15,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:54:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2019-11-22 13:54:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 13:54:15,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:15,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:15,716 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:54:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash -29640501, now seen corresponding path program 1 times [2019-11-22 13:54:15,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:15,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011161543] [2019-11-22 13:54:15,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:15,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011161543] [2019-11-22 13:54:15,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:15,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 13:54:15,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949506276] [2019-11-22 13:54:15,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:54:15,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:54:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:54:15,836 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand 4 states. [2019-11-22 13:54:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:16,202 INFO L93 Difference]: Finished difference Result 253 states and 346 transitions. [2019-11-22 13:54:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:54:16,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 13:54:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:16,206 INFO L225 Difference]: With dead ends: 253 [2019-11-22 13:54:16,206 INFO L226 Difference]: Without dead ends: 253 [2019-11-22 13:54:16,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:54:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-22 13:54:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 239. [2019-11-22 13:54:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-22 13:54:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 337 transitions. [2019-11-22 13:54:16,219 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 337 transitions. Word has length 24 [2019-11-22 13:54:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:16,220 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 337 transitions. [2019-11-22 13:54:16,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:54:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 337 transitions. [2019-11-22 13:54:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 13:54:16,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:16,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:16,224 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:54:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash -918855488, now seen corresponding path program 1 times [2019-11-22 13:54:16,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:16,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87399489] [2019-11-22 13:54:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:16,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87399489] [2019-11-22 13:54:16,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:16,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 13:54:16,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115281946] [2019-11-22 13:54:16,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:54:16,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:54:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:54:16,372 INFO L87 Difference]: Start difference. First operand 239 states and 337 transitions. Second operand 4 states. [2019-11-22 13:54:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:16,724 INFO L93 Difference]: Finished difference Result 257 states and 350 transitions. [2019-11-22 13:54:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:54:16,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-22 13:54:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:16,727 INFO L225 Difference]: With dead ends: 257 [2019-11-22 13:54:16,727 INFO L226 Difference]: Without dead ends: 257 [2019-11-22 13:54:16,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:54:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-22 13:54:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2019-11-22 13:54:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-22 13:54:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 339 transitions. [2019-11-22 13:54:16,737 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 339 transitions. Word has length 25 [2019-11-22 13:54:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:16,737 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 339 transitions. [2019-11-22 13:54:16,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:54:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 339 transitions. [2019-11-22 13:54:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 13:54:16,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:16,739 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:16,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:54:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2138371761, now seen corresponding path program 1 times [2019-11-22 13:54:16,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:16,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159626650] [2019-11-22 13:54:16,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:16,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159626650] [2019-11-22 13:54:16,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:16,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:54:16,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142432913] [2019-11-22 13:54:16,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:54:16,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:54:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:54:16,862 INFO L87 Difference]: Start difference. First operand 241 states and 339 transitions. Second operand 5 states. [2019-11-22 13:54:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:17,104 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2019-11-22 13:54:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:54:17,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-22 13:54:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:17,106 INFO L225 Difference]: With dead ends: 202 [2019-11-22 13:54:17,107 INFO L226 Difference]: Without dead ends: 202 [2019-11-22 13:54:17,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:54:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-22 13:54:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2019-11-22 13:54:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-22 13:54:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 263 transitions. [2019-11-22 13:54:17,125 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 263 transitions. Word has length 33 [2019-11-22 13:54:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:17,125 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 263 transitions. [2019-11-22 13:54:17,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:54:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 263 transitions. [2019-11-22 13:54:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 13:54:17,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:17,126 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:17,129 INFO L410 AbstractCegarLoop]: === Iteration 15 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:54:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash -138461554, now seen corresponding path program 1 times [2019-11-22 13:54:17,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:17,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839233262] [2019-11-22 13:54:17,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 13:54:17,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839233262] [2019-11-22 13:54:17,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347487207] [2019-11-22 13:54:17,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:54:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:17,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-22 13:54:17,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:54:17,834 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2019-11-22 13:54:17,836 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 13:54:17,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 202 treesize of output 258 [2019-11-22 13:54:17,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:17,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:18,116 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-11-22 13:54:18,117 INFO L567 ElimStorePlain]: treesize reduction 1301, result has 6.8 percent of original size [2019-11-22 13:54:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:18,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:54:18,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:95 [2019-11-22 13:54:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:18,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:18,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:18,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:19,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:19,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:19,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:54:19,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:19,277 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:54:19,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:19,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:19,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:54:19,351 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:19,418 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:19,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:54:19,421 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:19,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:19,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:19,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:19,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:54:19,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:19,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 121 [2019-11-22 13:54:19,525 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:19,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:19,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:54:19,601 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:19,648 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:19,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:54:19,650 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:19,917 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-22 13:54:19,918 INFO L567 ElimStorePlain]: treesize reduction 52, result has 81.0 percent of original size [2019-11-22 13:54:19,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 13:54:19,919 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:527, output treesize:12 [2019-11-22 13:54:19,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:20,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:20,529 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 13:54:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 13:54:20,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:54:20,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 13:54:20,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134556052] [2019-11-22 13:54:20,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:54:20,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:20,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:54:20,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:54:20,626 INFO L87 Difference]: Start difference. First operand 197 states and 263 transitions. Second operand 12 states. [2019-11-22 13:54:22,315 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 150 DAG size of output: 106 [2019-11-22 13:54:28,781 WARN L192 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-22 13:55:00,473 WARN L192 SmtUtils]: Spent 31.59 s on a formula simplification. DAG size of input: 167 DAG size of output: 109 [2019-11-22 13:55:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:21,047 INFO L93 Difference]: Finished difference Result 279 states and 357 transitions. [2019-11-22 13:55:21,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:55:21,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-22 13:55:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:21,051 INFO L225 Difference]: With dead ends: 279 [2019-11-22 13:55:21,051 INFO L226 Difference]: Without dead ends: 279 [2019-11-22 13:55:21,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:55:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-22 13:55:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 245. [2019-11-22 13:55:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-22 13:55:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 333 transitions. [2019-11-22 13:55:21,063 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 333 transitions. Word has length 33 [2019-11-22 13:55:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:21,063 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 333 transitions. [2019-11-22 13:55:21,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:55:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 333 transitions. [2019-11-22 13:55:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 13:55:21,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:21,065 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:21,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:55:21,266 INFO L410 AbstractCegarLoop]: === Iteration 16 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:55:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash -615136466, now seen corresponding path program 1 times [2019-11-22 13:55:21,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:21,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508956508] [2019-11-22 13:55:21,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:21,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508956508] [2019-11-22 13:55:21,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435780942] [2019-11-22 13:55:21,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:55:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:21,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-22 13:55:21,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:21,958 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 13:55:21,959 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 13:55:21,960 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 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:55:21,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:22,103 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-22 13:55:22,104 INFO L567 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-22 13:55:22,342 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 13:55:22,343 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 13:55:22,343 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 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 13:55:22,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:22,459 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-22 13:55:22,460 INFO L567 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-22 13:55:22,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:22,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:22,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:55:22,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-22 13:55:22,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:22,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:22,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:22,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:22,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,591 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:22,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:22,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:22,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:22,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:22,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:22,832 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:23,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:23,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:23,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:23,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:23,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:23,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:23,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:23,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:23,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:23,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:23,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,088 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:23,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:23,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:23,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:23,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:23,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:23,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:23,364 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:23,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:23,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-22 13:55:23,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:23,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:23,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 130 [2019-11-22 13:55:23,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:23,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:23,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2019-11-22 13:55:23,686 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:23,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:23,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 98 [2019-11-22 13:55:23,750 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:23,873 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:23,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 135 [2019-11-22 13:55:23,874 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:23,896 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 28 treesize of output 26 [2019-11-22 13:55:23,897 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:23,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:23,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:23,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 13:55:23,935 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:23,954 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:23,955 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:23,971 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:23,972 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 95 [2019-11-22 13:55:24,036 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,054 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,054 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,071 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,071 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,088 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,088 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,109 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:24,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,115 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 13:55:24,132 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,152 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:24,154 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-11-22 13:55:24,157 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,174 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,174 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,194 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:24,195 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 13:55:24,199 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:24,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 13:55:24,258 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 13:55:24,299 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,316 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,316 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,333 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,333 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,351 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,351 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,367 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,367 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:24,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 13:55:24,433 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,450 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,450 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,470 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,470 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,489 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,489 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,555 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 95 [2019-11-22 13:55:24,557 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,575 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,576 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 13:55:24,618 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,634 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,635 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,661 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,661 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:24,674 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 95 [2019-11-22 13:55:24,712 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,740 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 35 treesize of output 39 [2019-11-22 13:55:24,741 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,784 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 13:55:24,785 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,806 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,807 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,836 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,836 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,859 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,859 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:24,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:24,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:24,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 13:55:24,908 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,928 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,929 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,955 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:24,956 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:24,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 65 treesize of output 103 [2019-11-22 13:55:25,046 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,073 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,073 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,097 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:25,099 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 13:55:25,103 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:25,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 130 [2019-11-22 13:55:25,203 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,223 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,223 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 13:55:25,266 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,296 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 71 [2019-11-22 13:55:25,311 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:25,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 13:55:25,352 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,370 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,371 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,388 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,388 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,404 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,405 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:25,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 13:55:25,465 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,489 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,489 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 35 treesize of output 39 [2019-11-22 13:55:25,490 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,515 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,515 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,533 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,533 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,557 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2019-11-22 13:55:25,563 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,581 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,581 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,598 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,598 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:25,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 130 [2019-11-22 13:55:25,692 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,711 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,711 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,741 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 35 treesize of output 39 [2019-11-22 13:55:25,742 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,770 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,785 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 71 [2019-11-22 13:55:25,787 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:25,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 13:55:25,833 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,853 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,853 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,873 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,873 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:25,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 13:55:25,908 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:25,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:25,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 13:55:25,941 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,958 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,959 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,975 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,976 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:25,992 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:25,992 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:26,021 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 13:55:26,034 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,054 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,054 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,081 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 76 [2019-11-22 13:55:26,103 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,125 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,125 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,144 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,145 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,162 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,162 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,179 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,179 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:26,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 13:55:26,221 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,246 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,246 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:26,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 13:55:26,271 INFO L496 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,291 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,292 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 13:55:26,297 INFO L496 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,316 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:26,318 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 13:55:26,321 INFO L496 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,338 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,338 INFO L496 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:26,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,372 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,385 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 13:55:26,386 INFO L496 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,412 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 35 treesize of output 39 [2019-11-22 13:55:26,412 INFO L496 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:26,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-11-22 13:55:26,434 INFO L496 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,451 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,452 INFO L496 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,470 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,471 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,472 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,473 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 13:55:26,475 INFO L496 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,492 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,492 INFO L496 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,514 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 57 [2019-11-22 13:55:26,522 INFO L496 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,539 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,539 INFO L496 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,561 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,562 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,567 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 13:55:26,568 INFO L496 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,584 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,584 INFO L496 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,602 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,602 INFO L496 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,618 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,618 INFO L496 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,635 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,635 INFO L496 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,651 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,652 INFO L496 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,671 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,672 INFO L496 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,695 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,695 INFO L496 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,711 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,711 INFO L496 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,732 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,732 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2019-11-22 13:55:26,733 INFO L496 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,769 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,769 INFO L496 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,786 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,786 INFO L496 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,802 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,802 INFO L496 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,822 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 13:55:26,827 INFO L496 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,845 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,845 INFO L496 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,862 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,862 INFO L496 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,877 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,877 INFO L496 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,893 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,893 INFO L496 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,910 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,910 INFO L496 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:26,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:26,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 62 [2019-11-22 13:55:26,938 INFO L496 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,954 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,954 INFO L496 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,970 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,970 INFO L496 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:26,986 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:26,986 INFO L496 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,003 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,005 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 13:55:27,006 INFO L496 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,022 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,022 INFO L496 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,037 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,038 INFO L496 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,052 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,052 INFO L496 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,067 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,067 INFO L496 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,081 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,082 INFO L496 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,095 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,095 INFO L496 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,116 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,116 INFO L496 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,133 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 13:55:27,134 INFO L496 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,151 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,152 INFO L496 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-11-22 13:55:27,167 INFO L496 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,181 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,182 INFO L496 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,195 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,195 INFO L496 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,210 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,210 INFO L496 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,225 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,226 INFO L496 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,246 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,246 INFO L496 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,266 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,266 INFO L496 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,281 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,281 INFO L496 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,294 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,294 INFO L496 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,307 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,307 INFO L496 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,319 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,319 INFO L496 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,331 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,332 INFO L496 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,344 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,344 INFO L496 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,357 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,358 INFO L496 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,369 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,370 INFO L496 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,381 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,381 INFO L496 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,392 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,393 INFO L496 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,406 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,406 INFO L496 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,419 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,420 INFO L496 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,437 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,437 INFO L496 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,486 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,486 INFO L496 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,495 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,495 INFO L496 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,503 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,503 INFO L496 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,510 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,510 INFO L496 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,517 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,517 INFO L496 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,524 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,524 INFO L496 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,531 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:27,531 INFO L496 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,668 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-11-22 13:55:27,668 INFO L567 ElimStorePlain]: treesize reduction 812, result has 4.8 percent of original size [2019-11-22 13:55:27,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:27,679 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 20 treesize of output 24 [2019-11-22 13:55:27,680 INFO L496 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,683 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:27,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2019-11-22 13:55:27,685 INFO L496 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,713 INFO L567 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-22 13:55:27,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,713 INFO L221 ElimStorePlain]: Needed 153 recursive calls to eliminate 7 variables, input treesize:7491, output treesize:10 [2019-11-22 13:55:27,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:27,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:27,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:27,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:27,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:27,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:27,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:27,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:27,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:27,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:27,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:27,784 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:27,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:27,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:27,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:27,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:27,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:27,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:27,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:27,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:27,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:28,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:28,060 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:28,143 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 13:55:28,323 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:28,364 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:28,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:28,459 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:28,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:55:28,523 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:28,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:55:28,587 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:28,628 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:28,765 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:28,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 13:55:28,806 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:28,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:28,891 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:28,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:28,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:29,011 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:29,066 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:29,158 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:29,160 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,215 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:29,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:29,254 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:29,315 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,434 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:29,435 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:55:29,526 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:29,650 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 73 treesize of output 144 [2019-11-22 13:55:29,652 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:29,738 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:29,859 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:29,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:29,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:29,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 144 [2019-11-22 13:55:29,980 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:30,037 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 13:55:30,218 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,274 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:30,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:30,310 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,428 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:30,430 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:30,522 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 13:55:30,581 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:30,666 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 13:55:30,832 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,916 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:30,917 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:30,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:30,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:30,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:30,993 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:31,083 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:31,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 73 treesize of output 144 [2019-11-22 13:55:31,231 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:31,272 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:31,319 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:31,407 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:31,493 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:31,623 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:31,719 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2019-11-22 13:55:31,763 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,842 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:31,879 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:31,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:31,880 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:31,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:31,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:32,007 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:32,125 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 13:55:32,291 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 13:55:32,345 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 13:55:32,412 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,540 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:32,541 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:55:32,630 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:32,756 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:32,845 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:32,846 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:32,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:32,927 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:32,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:32,979 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:33,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:33,017 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:33,110 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:33,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:55:33,171 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:33,255 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:33,340 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 144 [2019-11-22 13:55:33,469 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:33,550 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:33,587 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:55:33,676 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:33,798 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:33,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:33,924 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:33,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:33,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:34,053 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,232 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 13:55:34,235 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,261 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 28 treesize of output 32 [2019-11-22 13:55:34,262 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:34,322 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,407 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:34,409 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:34,445 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,465 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-22 13:55:34,468 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:34,502 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,529 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,544 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 72 [2019-11-22 13:55:34,563 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,587 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,593 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:34,601 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:34,725 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:34,760 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,782 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:34,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:34,797 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:34,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:34,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 13:55:34,971 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:34,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,055 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:35,056 INFO L496 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,109 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,110 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 104 [2019-11-22 13:55:35,141 INFO L496 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,163 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 13:55:35,168 INFO L496 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:35,227 INFO L496 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 13:55:35,402 INFO L496 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,427 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:55:35,447 INFO L496 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:35,571 INFO L496 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 13:55:35,654 INFO L496 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,675 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,675 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 13:55:35,679 INFO L496 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:55:35,770 INFO L496 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:55:35,861 INFO L496 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:55:35,954 INFO L496 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:35,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,977 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:35,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,986 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:35,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:35,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:55:35,993 INFO L496 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:55:36,050 INFO L496 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:55:36,095 INFO L496 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:36,133 INFO L496 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,154 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-22 13:55:36,160 INFO L496 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:36,243 INFO L496 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,306 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 72 [2019-11-22 13:55:36,308 INFO L496 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,340 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,356 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 13:55:36,389 INFO L496 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2019-11-22 13:55:36,433 INFO L496 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 13:55:36,547 INFO L496 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:55:36,624 INFO L496 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:36,655 INFO L496 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,674 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,681 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 13:55:36,692 INFO L496 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,715 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:55:36,745 INFO L496 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,780 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,797 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:55:36,798 INFO L496 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,847 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:55:36,848 INFO L496 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 13:55:36,870 INFO L496 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:55:36,898 INFO L496 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,915 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,922 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,923 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:36,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:55:36,928 INFO L496 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:36,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:36,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:36,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 144 [2019-11-22 13:55:37,050 INFO L496 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,094 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 13:55:37,135 INFO L496 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,160 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:55:37,190 INFO L496 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,234 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,271 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 80 treesize of output 192 [2019-11-22 13:55:37,365 INFO L496 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,390 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:55:37,418 INFO L496 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,463 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:55:37,498 INFO L496 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,523 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,536 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 13:55:37,559 INFO L496 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,580 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,590 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 13:55:37,615 INFO L496 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,632 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,639 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:37,646 INFO L496 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,683 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,710 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 141 [2019-11-22 13:55:37,774 INFO L496 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:55:37,829 INFO L496 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 13:55:37,904 INFO L496 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,921 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-11-22 13:55:37,922 INFO L496 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,943 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,950 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,962 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:37,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 13:55:37,963 INFO L496 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,977 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:37,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-22 13:55:37,982 INFO L496 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:37,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:37,998 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-11-22 13:55:38,000 INFO L496 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:55:38,037 INFO L496 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 13:55:38,062 INFO L496 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,097 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:55:38,116 INFO L496 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,142 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,154 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:55:38,169 INFO L496 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:38,201 INFO L496 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:38,237 INFO L496 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,271 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:55:38,292 INFO L496 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:55:38,345 INFO L496 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,375 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 144 [2019-11-22 13:55:38,479 INFO L496 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 13:55:38,532 INFO L496 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,555 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,561 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,561 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:55:38,567 INFO L496 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,591 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 13:55:38,604 INFO L496 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:38,636 INFO L496 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,682 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 13:55:38,716 INFO L496 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,737 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:38,750 INFO L496 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,776 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:55:38,830 INFO L496 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 144 [2019-11-22 13:55:38,944 INFO L496 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:38,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:38,966 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:38,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:38,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 13:55:38,982 INFO L496 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,013 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:39,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2019-11-22 13:55:39,021 INFO L496 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,074 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:39,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:55:39,075 INFO L496 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,101 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,158 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:39,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 13:55:39,159 INFO L496 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:39,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:55:39,241 INFO L496 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:39,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:55:39,274 INFO L496 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,296 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:39,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:55:39,350 INFO L496 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,365 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,368 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-22 13:55:39,369 INFO L496 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,407 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:39,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 13:55:39,450 INFO L496 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:39,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:39,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:39,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:55:39,486 INFO L496 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,843 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 16 [2019-11-22 13:55:39,847 INFO L567 ElimStorePlain]: treesize reduction 3331, result has 0.6 percent of original size [2019-11-22 13:55:39,854 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 12 treesize of output 14 [2019-11-22 13:55:39,854 INFO L496 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:39,868 INFO L567 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-22 13:55:39,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 13:55:39,869 INFO L221 ElimStorePlain]: Needed 154 recursive calls to eliminate 8 variables, input treesize:8359, output treesize:14 [2019-11-22 13:55:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:39,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:55:39,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2019-11-22 13:55:39,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500953590] [2019-11-22 13:55:39,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-22 13:55:39,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-22 13:55:39,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-22 13:55:39,945 INFO L87 Difference]: Start difference. First operand 245 states and 333 transitions. Second operand 19 states. [2019-11-22 13:55:40,562 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-11-22 13:55:51,044 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-22 13:56:01,285 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-22 13:56:11,581 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-11-22 13:56:11,852 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-22 13:56:12,040 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-22 13:57:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:16,681 INFO L93 Difference]: Finished difference Result 387 states and 520 transitions. [2019-11-22 13:57:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-22 13:57:16,682 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-22 13:57:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:16,685 INFO L225 Difference]: With dead ends: 387 [2019-11-22 13:57:16,685 INFO L226 Difference]: Without dead ends: 387 [2019-11-22 13:57:16,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=441, Invalid=1199, Unknown=0, NotChecked=0, Total=1640 [2019-11-22 13:57:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-22 13:57:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 319. [2019-11-22 13:57:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-22 13:57:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 441 transitions. [2019-11-22 13:57:16,702 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 441 transitions. Word has length 35 [2019-11-22 13:57:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:16,703 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 441 transitions. [2019-11-22 13:57:16,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-22 13:57:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 441 transitions. [2019-11-22 13:57:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 13:57:16,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:16,704 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:57:16,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:16,908 INFO L410 AbstractCegarLoop]: === Iteration 17 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:57:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2659210, now seen corresponding path program 1 times [2019-11-22 13:57:16,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:57:16,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657947389] [2019-11-22 13:57:16,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:57:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 13:57:17,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657947389] [2019-11-22 13:57:17,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253112753] [2019-11-22 13:57:17,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:17,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 13:57:17,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:57:17,445 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 5=[|v_#valid_53|]} [2019-11-22 13:57:17,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:17,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:17,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:17,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:17,611 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-22 13:57:17,611 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-22 13:57:17,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:57:17,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,697 INFO L567 ElimStorePlain]: treesize reduction 50, result has 59.7 percent of original size [2019-11-22 13:57:17,712 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 47 treesize of output 45 [2019-11-22 13:57:17,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-22 13:57:17,790 INFO L567 ElimStorePlain]: treesize reduction 26, result has 72.9 percent of original size [2019-11-22 13:57:17,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:57:17,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:45, output treesize:70 [2019-11-22 13:57:17,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:18,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 13:57:18,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:18,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:18,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 13:57:18,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:18,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:18,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 13:57:18,904 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:18,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:18,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 13:57:18,936 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:18,989 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:18,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 13:57:18,990 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,041 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:19,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 13:57:19,043 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:19,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 13:57:19,098 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,113 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:19,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 13:57:19,114 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,118 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:19,119 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:19,134 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:19,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:19,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-22 13:57:19,141 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:19,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:19,159 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:19,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-22 13:57:19,160 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:19,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 13:57:19,176 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,191 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:19,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 13:57:19,191 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-11-22 13:57:19,198 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,202 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:19,202 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,207 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:19,208 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,212 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:19,212 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,266 INFO L567 ElimStorePlain]: treesize reduction 267, result has 4.0 percent of original size [2019-11-22 13:57:19,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:57:19,267 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:669, output treesize:7 [2019-11-22 13:57:19,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:19,680 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-11-22 13:57:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 13:57:19,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:57:19,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2019-11-22 13:57:19,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512336706] [2019-11-22 13:57:19,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 13:57:19,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:57:19,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 13:57:19,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:57:19,734 INFO L87 Difference]: Start difference. First operand 319 states and 441 transitions. Second operand 13 states. [2019-11-22 13:57:19,952 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-22 13:57:20,637 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-22 13:57:20,975 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-11-22 13:57:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:21,520 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2019-11-22 13:57:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:57:21,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-22 13:57:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:21,523 INFO L225 Difference]: With dead ends: 331 [2019-11-22 13:57:21,523 INFO L226 Difference]: Without dead ends: 329 [2019-11-22 13:57:21,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:57:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-22 13:57:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2019-11-22 13:57:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-22 13:57:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 436 transitions. [2019-11-22 13:57:21,534 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 436 transitions. Word has length 34 [2019-11-22 13:57:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:21,535 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 436 transitions. [2019-11-22 13:57:21,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 13:57:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 436 transitions. [2019-11-22 13:57:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 13:57:21,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:21,536 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:57:21,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:21,740 INFO L410 AbstractCegarLoop]: === Iteration 18 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:57:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1559342765, now seen corresponding path program 1 times [2019-11-22 13:57:21,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:57:21,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496124532] [2019-11-22 13:57:21,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:57:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:22,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496124532] [2019-11-22 13:57:22,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882404150] [2019-11-22 13:57:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:22,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 13:57:22,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:57:22,654 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 9 treesize of output 3 [2019-11-22 13:57:22,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:22,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:22,672 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 9 treesize of output 3 [2019-11-22 13:57:22,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:22,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:22,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:57:22,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-22 13:57:22,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:22,758 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-11-22 13:57:22,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:22,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:22,773 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 16 treesize of output 18 [2019-11-22 13:57:22,773 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:22,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:22,785 INFO L496 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-11-22 13:57:22,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-22 13:57:22,867 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 25 treesize of output 13 [2019-11-22 13:57:22,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:22,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:22,879 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-11-22 13:57:22,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:22,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:22,887 INFO L496 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-11-22 13:57:22,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-22 13:57:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:22,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:57:22,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 26 [2019-11-22 13:57:22,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259148506] [2019-11-22 13:57:22,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 13:57:22,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:57:22,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 13:57:22,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-11-22 13:57:22,926 INFO L87 Difference]: Start difference. First operand 317 states and 436 transitions. Second operand 27 states. [2019-11-22 13:57:23,224 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-22 13:57:23,423 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2019-11-22 13:57:24,362 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-22 13:57:24,575 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2019-11-22 13:57:24,925 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-22 13:57:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:26,098 INFO L93 Difference]: Finished difference Result 361 states and 488 transitions. [2019-11-22 13:57:26,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 13:57:26,099 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-11-22 13:57:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:26,102 INFO L225 Difference]: With dead ends: 361 [2019-11-22 13:57:26,102 INFO L226 Difference]: Without dead ends: 361 [2019-11-22 13:57:26,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2019-11-22 13:57:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-22 13:57:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 318. [2019-11-22 13:57:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-22 13:57:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 433 transitions. [2019-11-22 13:57:26,115 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 433 transitions. Word has length 37 [2019-11-22 13:57:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:26,116 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 433 transitions. [2019-11-22 13:57:26,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 13:57:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 433 transitions. [2019-11-22 13:57:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-22 13:57:26,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:26,117 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:57:26,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:26,325 INFO L410 AbstractCegarLoop]: === Iteration 19 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:57:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1566995341, now seen corresponding path program 1 times [2019-11-22 13:57:26,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:57:26,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102165530] [2019-11-22 13:57:26,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:57:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 13:57:26,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102165530] [2019-11-22 13:57:26,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:57:26,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 13:57:26,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526847579] [2019-11-22 13:57:26,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 13:57:26,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:57:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 13:57:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:57:26,509 INFO L87 Difference]: Start difference. First operand 318 states and 433 transitions. Second operand 9 states. [2019-11-22 13:57:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:27,022 INFO L93 Difference]: Finished difference Result 316 states and 409 transitions. [2019-11-22 13:57:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:57:27,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-11-22 13:57:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:27,024 INFO L225 Difference]: With dead ends: 316 [2019-11-22 13:57:27,024 INFO L226 Difference]: Without dead ends: 316 [2019-11-22 13:57:27,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:57:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-22 13:57:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2019-11-22 13:57:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-22 13:57:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 390 transitions. [2019-11-22 13:57:27,036 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 390 transitions. Word has length 46 [2019-11-22 13:57:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:27,037 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 390 transitions. [2019-11-22 13:57:27,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 13:57:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 390 transitions. [2019-11-22 13:57:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-22 13:57:27,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:27,038 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:57:27,038 INFO L410 AbstractCegarLoop]: === Iteration 20 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:57:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash -415186385, now seen corresponding path program 1 times [2019-11-22 13:57:27,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:57:27,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937364189] [2019-11-22 13:57:27,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:57:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:27,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937364189] [2019-11-22 13:57:27,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334320975] [2019-11-22 13:57:27,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-22 13:57:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:27,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-22 13:57:27,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:57:27,780 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 8=[|v_#valid_55|]} [2019-11-22 13:57:27,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:27,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:27,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:27,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:27,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:27,938 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-11-22 13:57:27,939 INFO L343 Elim1Store]: treesize reduction 86, result has 52.7 percent of original size [2019-11-22 13:57:27,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:57:27,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,051 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-22 13:57:28,052 INFO L567 ElimStorePlain]: treesize reduction 50, result has 68.6 percent of original size [2019-11-22 13:57:28,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:28,068 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 71 treesize of output 75 [2019-11-22 13:57:28,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-22 13:57:28,208 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-22 13:57:28,209 INFO L567 ElimStorePlain]: treesize reduction 147, result has 40.0 percent of original size [2019-11-22 13:57:28,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:57:28,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:98 [2019-11-22 13:57:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:28,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:28,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 106 [2019-11-22 13:57:28,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:28,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 75 [2019-11-22 13:57:28,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2019-11-22 13:57:28,751 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,839 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:28,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 149 [2019-11-22 13:57:28,840 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:28,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:28,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:28,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:28,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 82 [2019-11-22 13:57:28,873 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:28,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 106 [2019-11-22 13:57:28,926 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,932 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:28,932 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:28,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:28,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 98 [2019-11-22 13:57:28,981 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:28,989 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:28,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:29,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:29,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 85 [2019-11-22 13:57:29,010 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:29,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2019-11-22 13:57:29,021 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:29,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:29,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:29,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2019-11-22 13:57:29,047 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:29,052 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:29,052 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:29,057 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:29,057 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:29,265 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-22 13:57:29,266 INFO L567 ElimStorePlain]: treesize reduction 297, result has 33.0 percent of original size [2019-11-22 13:57:29,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 13:57:29,266 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:951, output treesize:67 [2019-11-22 13:57:29,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:29,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:30,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:30,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:30,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 66 treesize of output 192 [2019-11-22 13:57:30,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:30,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:30,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:30,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 66 treesize of output 192 [2019-11-22 13:57:30,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:30,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:30,817 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:30,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 13:57:30,819 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:30,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:30,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:30,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 138 [2019-11-22 13:57:30,916 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:30,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:31,087 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 13:57:31,087 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:31,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 58 treesize of output 200 [2019-11-22 13:57:31,089 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:31,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:31,303 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-22 13:57:31,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:31,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 246 [2019-11-22 13:57:31,306 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:31,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:31,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:31,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 100 [2019-11-22 13:57:31,377 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:31,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:31,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:31,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 13:57:31,490 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:31,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:31,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:31,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 188 [2019-11-22 13:57:31,643 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:31,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:31,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:31,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 100 [2019-11-22 13:57:31,714 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:31,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:31,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:31,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 188 [2019-11-22 13:57:31,866 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:31,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:31,973 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:31,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 13:57:31,975 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:31,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:32,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:32,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 13:57:32,061 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,653 WARN L192 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2019-11-22 13:57:32,654 INFO L567 ElimStorePlain]: treesize reduction 1368, result has 20.3 percent of original size [2019-11-22 13:57:32,663 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 55 treesize of output 51 [2019-11-22 13:57:32,664 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2019-11-22 13:57:32,671 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2019-11-22 13:57:32,677 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,683 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 55 treesize of output 51 [2019-11-22 13:57:32,684 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2019-11-22 13:57:32,693 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,888 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-22 13:57:32,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:32,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2019-11-22 13:57:32,898 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,903 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 48 treesize of output 44 [2019-11-22 13:57:32,904 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,909 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 48 treesize of output 44 [2019-11-22 13:57:32,909 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2019-11-22 13:57:32,916 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:32,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2019-11-22 13:57:32,923 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:33,081 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-22 13:57:33,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:33,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 5 xjuncts. [2019-11-22 13:57:33,102 INFO L221 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:795, output treesize:278 [2019-11-22 13:57:33,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:33,479 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-11-22 13:57:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:33,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:57:33,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-11-22 13:57:33,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492181350] [2019-11-22 13:57:33,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 13:57:33,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:57:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 13:57:33,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-22 13:57:33,611 INFO L87 Difference]: Start difference. First operand 301 states and 390 transitions. Second operand 23 states. [2019-11-22 13:57:34,706 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-11-22 13:57:35,106 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-11-22 13:57:35,275 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-22 13:57:35,665 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-11-22 13:57:37,058 WARN L192 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 141 [2019-11-22 13:57:45,657 WARN L192 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 226 DAG size of output: 184 [2019-11-22 13:57:50,241 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-22 13:57:53,146 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 139 [2019-11-22 13:58:09,635 WARN L192 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 217 DAG size of output: 180 [2019-11-22 13:58:25,089 WARN L192 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-11-22 13:58:27,929 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 148 [2019-11-22 13:58:32,351 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2019-11-22 13:58:43,254 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-22 13:58:44,357 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2019-11-22 13:58:56,559 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2019-11-22 13:58:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:57,658 INFO L93 Difference]: Finished difference Result 385 states and 454 transitions. [2019-11-22 13:58:57,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-22 13:58:57,659 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-22 13:58:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:57,660 INFO L225 Difference]: With dead ends: 385 [2019-11-22 13:58:57,660 INFO L226 Difference]: Without dead ends: 385 [2019-11-22 13:58:57,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=467, Invalid=1503, Unknown=10, NotChecked=0, Total=1980 [2019-11-22 13:58:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-22 13:58:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 334. [2019-11-22 13:58:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-22 13:58:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 410 transitions. [2019-11-22 13:58:57,670 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 410 transitions. Word has length 39 [2019-11-22 13:58:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:57,671 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 410 transitions. [2019-11-22 13:58:57,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 13:58:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 410 transitions. [2019-11-22 13:58:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 13:58:57,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:57,672 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:58:57,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:57,877 INFO L410 AbstractCegarLoop]: === Iteration 21 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:58:57,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:57,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1604386484, now seen corresponding path program 1 times [2019-11-22 13:58:57,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:57,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990377452] [2019-11-22 13:58:57,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:58:58,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990377452] [2019-11-22 13:58:58,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069193521] [2019-11-22 13:58:58,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-22 13:58:58,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:58,856 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 15=[|v_#valid_56|]} [2019-11-22 13:58:58,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,929 INFO L343 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2019-11-22 13:58:58,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 37 [2019-11-22 13:58:58,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:58,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:58,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:58,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:59,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:59,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:59,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:59,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 172 [2019-11-22 13:58:59,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:59,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:59,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:59,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:59,158 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-11-22 13:58:59,159 INFO L567 ElimStorePlain]: treesize reduction 342, result has 23.3 percent of original size [2019-11-22 13:58:59,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:58:59,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:104 [2019-11-22 13:58:59,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:59,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 76 [2019-11-22 13:58:59,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:59,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:59,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:58:59,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:53 [2019-11-22 13:58:59,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:59,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:59,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 168 [2019-11-22 13:58:59,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:00,093 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-11-22 13:59:00,093 INFO L567 ElimStorePlain]: treesize reduction 84, result has 61.5 percent of original size [2019-11-22 13:59:00,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:00,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:107, output treesize:134 [2019-11-22 13:59:00,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,604 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-22 13:59:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:01,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2019-11-22 13:59:01,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:01,436 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-22 13:59:01,437 INFO L567 ElimStorePlain]: treesize reduction 28, result has 84.3 percent of original size [2019-11-22 13:59:01,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2019-11-22 13:59:01,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:01,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:01,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2019-11-22 13:59:01,509 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:01,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:01,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2019-11-22 13:59:01,562 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:01,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:01,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 13:59:01,608 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:208, output treesize:84 [2019-11-22 13:59:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:01,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:01,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 27 [2019-11-22 13:59:01,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268230159] [2019-11-22 13:59:01,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-22 13:59:01,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-22 13:59:01,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-11-22 13:59:01,759 INFO L87 Difference]: Start difference. First operand 334 states and 410 transitions. Second operand 28 states. [2019-11-22 13:59:02,046 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-22 13:59:02,320 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-11-22 13:59:02,732 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-11-22 13:59:03,156 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-22 13:59:03,428 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-11-22 13:59:03,712 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-22 13:59:04,324 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-11-22 13:59:04,781 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-22 13:59:05,125 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-22 13:59:05,589 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2019-11-22 13:59:06,164 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 129 [2019-11-22 13:59:06,825 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 144 [2019-11-22 13:59:07,642 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 144 [2019-11-22 13:59:08,245 WARN L192 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-11-22 13:59:08,616 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 138 [2019-11-22 13:59:09,317 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-11-22 13:59:09,920 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-22 13:59:10,768 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-22 13:59:11,005 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-11-22 13:59:11,457 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-22 13:59:11,732 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-22 13:59:12,260 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-11-22 13:59:12,856 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-11-22 13:59:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:13,327 INFO L93 Difference]: Finished difference Result 408 states and 478 transitions. [2019-11-22 13:59:13,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-22 13:59:13,328 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-22 13:59:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:13,330 INFO L225 Difference]: With dead ends: 408 [2019-11-22 13:59:13,330 INFO L226 Difference]: Without dead ends: 408 [2019-11-22 13:59:13,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=751, Invalid=2670, Unknown=1, NotChecked=0, Total=3422 [2019-11-22 13:59:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-22 13:59:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 333. [2019-11-22 13:59:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-22 13:59:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 406 transitions. [2019-11-22 13:59:13,342 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 406 transitions. Word has length 45 [2019-11-22 13:59:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:13,343 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 406 transitions. [2019-11-22 13:59:13,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-22 13:59:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 406 transitions. [2019-11-22 13:59:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-22 13:59:13,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:13,344 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:13,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:13,549 INFO L410 AbstractCegarLoop]: === Iteration 22 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:59:13,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1186742862, now seen corresponding path program 1 times [2019-11-22 13:59:13,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:13,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157820386] [2019-11-22 13:59:13,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:13,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157820386] [2019-11-22 13:59:13,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095424799] [2019-11-22 13:59:13,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:13,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-22 13:59:13,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:13,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:13,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 5 [2019-11-22 13:59:13,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646893750] [2019-11-22 13:59:13,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:13,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:13,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:13,887 INFO L87 Difference]: Start difference. First operand 333 states and 406 transitions. Second operand 6 states. [2019-11-22 13:59:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:14,179 INFO L93 Difference]: Finished difference Result 345 states and 417 transitions. [2019-11-22 13:59:14,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:59:14,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-22 13:59:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:14,183 INFO L225 Difference]: With dead ends: 345 [2019-11-22 13:59:14,184 INFO L226 Difference]: Without dead ends: 345 [2019-11-22 13:59:14,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-22 13:59:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 332. [2019-11-22 13:59:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-22 13:59:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 404 transitions. [2019-11-22 13:59:14,194 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 404 transitions. Word has length 50 [2019-11-22 13:59:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:14,194 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 404 transitions. [2019-11-22 13:59:14,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 404 transitions. [2019-11-22 13:59:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-22 13:59:14,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:14,196 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:14,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:14,408 INFO L410 AbstractCegarLoop]: === Iteration 23 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:59:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:14,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1865676899, now seen corresponding path program 1 times [2019-11-22 13:59:14,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:14,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554382604] [2019-11-22 13:59:14,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:14,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554382604] [2019-11-22 13:59:14,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626249946] [2019-11-22 13:59:14,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 13:59:14,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:14,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:14,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 5 [2019-11-22 13:59:14,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045030236] [2019-11-22 13:59:14,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:14,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:14,719 INFO L87 Difference]: Start difference. First operand 332 states and 404 transitions. Second operand 6 states. [2019-11-22 13:59:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:15,011 INFO L93 Difference]: Finished difference Result 344 states and 415 transitions. [2019-11-22 13:59:15,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:59:15,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-22 13:59:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:15,013 INFO L225 Difference]: With dead ends: 344 [2019-11-22 13:59:15,013 INFO L226 Difference]: Without dead ends: 344 [2019-11-22 13:59:15,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-22 13:59:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2019-11-22 13:59:15,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-22 13:59:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 402 transitions. [2019-11-22 13:59:15,022 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 402 transitions. Word has length 51 [2019-11-22 13:59:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:15,022 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 402 transitions. [2019-11-22 13:59:15,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 402 transitions. [2019-11-22 13:59:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 13:59:15,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:15,024 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:15,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:15,228 INFO L410 AbstractCegarLoop]: === Iteration 24 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:59:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2001408976, now seen corresponding path program 1 times [2019-11-22 13:59:15,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:15,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160682211] [2019-11-22 13:59:15,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:15,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160682211] [2019-11-22 13:59:15,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538963913] [2019-11-22 13:59:15,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:15,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-22 13:59:15,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:15,511 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-11-22 13:59:15,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:15,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:15,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:15,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 13:59:15,532 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:15,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-22 13:59:15,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:15,550 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-22 13:59:15,550 INFO L496 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-11-22 13:59:15,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-22 13:59:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:15,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:15,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-22 13:59:15,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799426670] [2019-11-22 13:59:15,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:59:15,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:15,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:59:15,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:59:15,568 INFO L87 Difference]: Start difference. First operand 331 states and 402 transitions. Second operand 7 states. [2019-11-22 13:59:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:16,269 INFO L93 Difference]: Finished difference Result 357 states and 421 transitions. [2019-11-22 13:59:16,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:59:16,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-22 13:59:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:16,272 INFO L225 Difference]: With dead ends: 357 [2019-11-22 13:59:16,272 INFO L226 Difference]: Without dead ends: 357 [2019-11-22 13:59:16,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 13:59:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-22 13:59:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 334. [2019-11-22 13:59:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-22 13:59:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 404 transitions. [2019-11-22 13:59:16,280 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 404 transitions. Word has length 52 [2019-11-22 13:59:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:16,280 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 404 transitions. [2019-11-22 13:59:16,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:59:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 404 transitions. [2019-11-22 13:59:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-22 13:59:16,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:16,282 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:16,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:16,486 INFO L410 AbstractCegarLoop]: === Iteration 25 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:59:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1038016890, now seen corresponding path program 1 times [2019-11-22 13:59:16,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:16,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572714839] [2019-11-22 13:59:16,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 13:59:16,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572714839] [2019-11-22 13:59:16,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907656102] [2019-11-22 13:59:16,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 13:59:16,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:16,947 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 13:59:16,947 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 13:59:16,948 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 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 13:59:16,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:16,999 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 13:59:17,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:17,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:17,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 13:59:17,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:17,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:17,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:17,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:17,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:17,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 34 treesize of output 142 [2019-11-22 13:59:17,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,638 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:17,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,639 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:17,639 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,640 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:17,640 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,641 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:17,641 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,642 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:17,642 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,643 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:17,643 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:17,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,645 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 13:59:17,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:17,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:18,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:18,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 34 treesize of output 142 [2019-11-22 13:59:18,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:18,012 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:18,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:18,013 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:18,013 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:18,014 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:18,014 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:18,014 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:18,014 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:18,015 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:18,015 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:18,016 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:18,016 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:18,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:18,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:18,018 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 13:59:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 13:59:18,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:18,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 13:59:18,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981756495] [2019-11-22 13:59:18,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:59:18,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:59:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:59:18,368 INFO L87 Difference]: Start difference. First operand 334 states and 404 transitions. Second operand 12 states. [2019-11-22 13:59:18,707 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-22 13:59:21,202 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-22 13:59:21,363 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-22 13:59:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:25,590 INFO L93 Difference]: Finished difference Result 354 states and 419 transitions. [2019-11-22 13:59:25,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:25,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-22 13:59:25,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:25,591 INFO L225 Difference]: With dead ends: 354 [2019-11-22 13:59:25,591 INFO L226 Difference]: Without dead ends: 354 [2019-11-22 13:59:25,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:59:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-22 13:59:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 334. [2019-11-22 13:59:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-22 13:59:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 401 transitions. [2019-11-22 13:59:25,599 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 401 transitions. Word has length 54 [2019-11-22 13:59:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:25,600 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 401 transitions. [2019-11-22 13:59:25,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:59:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 401 transitions. [2019-11-22 13:59:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-22 13:59:25,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:25,602 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:25,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:25,805 INFO L410 AbstractCegarLoop]: === Iteration 26 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:59:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:25,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2113752430, now seen corresponding path program 1 times [2019-11-22 13:59:25,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:25,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505694035] [2019-11-22 13:59:25,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 13:59:26,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505694035] [2019-11-22 13:59:26,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425569310] [2019-11-22 13:59:26,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:26,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 13:59:26,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:26,359 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 13:59:26,360 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 13:59:26,360 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 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:59:26,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,434 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 13:59:26,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:26,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:54 [2019-11-22 13:59:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:26,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:26,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-22 13:59:26,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-22 13:59:26,810 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:26,838 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,849 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,850 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 17 treesize of output 21 [2019-11-22 13:59:26,850 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,875 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:26,876 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,890 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 17 treesize of output 21 [2019-11-22 13:59:26,890 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 40 [2019-11-22 13:59:26,920 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 43 [2019-11-22 13:59:26,950 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,956 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,958 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 13:59:26,966 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,974 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,976 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:26,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-22 13:59:26,981 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:26,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:26,996 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 17 treesize of output 21 [2019-11-22 13:59:26,996 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,002 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,005 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 24 [2019-11-22 13:59:27,014 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,028 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 17 treesize of output 21 [2019-11-22 13:59:27,028 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,039 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,040 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,040 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,041 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,047 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,048 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,048 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,049 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,051 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,058 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,058 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,060 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,067 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,070 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,075 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,078 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,085 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:27,089 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,094 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-22 13:59:27,096 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,104 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,105 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,110 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,112 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,112 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,113 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,113 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:27,115 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,122 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,122 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,123 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,130 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,133 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,133 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:27,134 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,140 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 12 treesize of output 10 [2019-11-22 13:59:27,140 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,145 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,145 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,150 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,150 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,154 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,154 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,159 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,159 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,164 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,164 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,166 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,167 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,203 INFO L567 ElimStorePlain]: treesize reduction 143, result has 4.7 percent of original size [2019-11-22 13:59:27,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,204 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-22 13:59:27,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:27,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,361 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 17 treesize of output 21 [2019-11-22 13:59:27,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:27,393 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,405 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 17 treesize of output 21 [2019-11-22 13:59:27,406 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,425 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 13:59:27,426 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,436 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:27,461 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,470 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-22 13:59:27,474 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,486 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,488 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 24 [2019-11-22 13:59:27,499 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,521 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,536 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,537 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 43 [2019-11-22 13:59:27,537 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,551 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 17 treesize of output 21 [2019-11-22 13:59:27,551 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,557 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,560 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,568 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,568 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,570 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:27,583 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 17 treesize of output 21 [2019-11-22 13:59:27,584 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,591 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,591 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,593 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,594 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,605 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,612 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,613 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,613 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,614 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,614 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,615 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,615 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,616 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:27,617 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,623 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,625 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,626 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,626 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,627 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,632 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,633 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,633 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,635 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,641 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,641 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,643 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,643 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,645 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,655 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,661 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,662 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,663 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,663 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,664 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,666 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,674 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:27,674 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,680 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-22 13:59:27,681 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,689 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:27,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:27,691 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,696 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 12 treesize of output 10 [2019-11-22 13:59:27,696 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,701 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,702 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,705 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,705 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,710 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,711 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,715 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,715 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,720 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,720 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,723 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:27,724 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,750 INFO L567 ElimStorePlain]: treesize reduction 90, result has 7.2 percent of original size [2019-11-22 13:59:27,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:27,751 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-22 13:59:27,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:27,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:28,009 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 17 [2019-11-22 13:59:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 13:59:28,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:28,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-22 13:59:28,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128164592] [2019-11-22 13:59:28,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:59:28,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:59:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:59:28,051 INFO L87 Difference]: Start difference. First operand 334 states and 401 transitions. Second operand 12 states. [2019-11-22 13:59:28,252 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-22 13:59:28,799 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-11-22 13:59:29,103 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-11-22 13:59:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:29,311 INFO L93 Difference]: Finished difference Result 349 states and 415 transitions. [2019-11-22 13:59:29,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:59:29,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-22 13:59:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:29,314 INFO L225 Difference]: With dead ends: 349 [2019-11-22 13:59:29,314 INFO L226 Difference]: Without dead ends: 349 [2019-11-22 13:59:29,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-22 13:59:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-22 13:59:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 334. [2019-11-22 13:59:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-22 13:59:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 399 transitions. [2019-11-22 13:59:29,323 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 399 transitions. Word has length 55 [2019-11-22 13:59:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:29,323 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 399 transitions. [2019-11-22 13:59:29,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:59:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 399 transitions. [2019-11-22 13:59:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-22 13:59:29,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:29,325 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:29,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:29,529 INFO L410 AbstractCegarLoop]: === Iteration 27 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:59:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash -921542745, now seen corresponding path program 1 times [2019-11-22 13:59:29,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:29,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146580821] [2019-11-22 13:59:29,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-22 13:59:29,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146580821] [2019-11-22 13:59:29,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005976813] [2019-11-22 13:59:29,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-22 13:59:30,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:30,039 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 9=[|v_#valid_60|]} [2019-11-22 13:59:30,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,130 INFO L343 Elim1Store]: treesize reduction 142, result has 12.9 percent of original size [2019-11-22 13:59:30,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 13:59:30,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:30,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:30,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-22 13:59:30,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-22 13:59:30,240 INFO L567 ElimStorePlain]: treesize reduction 14, result has 81.6 percent of original size [2019-11-22 13:59:30,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:30,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:62 [2019-11-22 13:59:30,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:30,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-22 13:59:30,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:30,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:30,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:30,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-22 13:59:30,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:30,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-22 13:59:30,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:30,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:30,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:30,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-22 13:59:30,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:30,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:30,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 120 [2019-11-22 13:59:30,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:30,980 INFO L567 ElimStorePlain]: treesize reduction 60, result has 54.5 percent of original size [2019-11-22 13:59:30,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-22 13:59:30,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:31,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-22 13:59:31,024 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:31,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:31,061 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:58 [2019-11-22 13:59:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:31,415 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-22 13:59:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-22 13:59:31,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:31,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2019-11-22 13:59:31,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680767255] [2019-11-22 13:59:31,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 13:59:31,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 13:59:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-22 13:59:31,454 INFO L87 Difference]: Start difference. First operand 334 states and 399 transitions. Second operand 21 states. [2019-11-22 13:59:31,680 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-22 13:59:31,891 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-22 13:59:32,283 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-22 13:59:32,487 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-11-22 13:59:32,930 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-11-22 13:59:33,371 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-11-22 13:59:33,641 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-22 13:59:34,133 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-11-22 13:59:34,484 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2019-11-22 13:59:34,876 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-22 13:59:35,167 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-11-22 13:59:35,588 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-22 13:59:36,065 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-22 13:59:37,176 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-11-22 13:59:37,654 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-22 13:59:38,354 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-22 13:59:39,812 WARN L192 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 151 [2019-11-22 13:59:40,992 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-11-22 13:59:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:43,420 INFO L93 Difference]: Finished difference Result 356 states and 416 transitions. [2019-11-22 13:59:43,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-22 13:59:43,420 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-11-22 13:59:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:43,422 INFO L225 Difference]: With dead ends: 356 [2019-11-22 13:59:43,422 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 13:59:43,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=494, Invalid=1576, Unknown=0, NotChecked=0, Total=2070 [2019-11-22 13:59:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 13:59:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 333. [2019-11-22 13:59:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-22 13:59:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 393 transitions. [2019-11-22 13:59:43,430 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 393 transitions. Word has length 60 [2019-11-22 13:59:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:43,431 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 393 transitions. [2019-11-22 13:59:43,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 13:59:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 393 transitions. [2019-11-22 13:59:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-22 13:59:43,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:43,433 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:43,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:43,635 INFO L410 AbstractCegarLoop]: === Iteration 28 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 13:59:43,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash 410180855, now seen corresponding path program 1 times [2019-11-22 13:59:43,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:43,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655506934] [2019-11-22 13:59:43,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:44,805 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-22 13:59:45,226 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-22 13:59:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:59:45,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655506934] [2019-11-22 13:59:45,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455692039] [2019-11-22 13:59:45,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:45,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-22 13:59:45,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:45,580 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 13:59:45,581 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 13:59:45,581 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 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 13:59:45,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:45,636 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 13:59:45,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:45,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:45,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 13:59:45,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:45,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:45,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:45,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:46,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:46,256 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 13:59:46,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:46,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 39 treesize of output 193 [2019-11-22 13:59:46,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:46,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 34 treesize of output 142 [2019-11-22 13:59:46,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,373 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:46,373 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,374 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:46,374 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,375 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:46,375 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,375 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:46,376 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,376 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:46,376 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,382 INFO L567 ElimStorePlain]: treesize reduction 29, result has 9.4 percent of original size [2019-11-22 13:59:46,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,382 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 13:59:46,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:46,552 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 13:59:46,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:46,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 13:59:46,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,718 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 13:59:46,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:46,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 13:59:46,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,958 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-22 13:59:46,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:46,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 41 treesize of output 249 [2019-11-22 13:59:46,961 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:47,133 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 13:59:47,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:47,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 13:59:47,135 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:47,302 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 13:59:47,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:47,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 39 treesize of output 193 [2019-11-22 13:59:47,305 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:47,473 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 13:59:47,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:47,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 13:59:47,476 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:47,615 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 13:59:47,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:47,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 13:59:47,618 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:47,760 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-11-22 13:59:47,761 INFO L567 ElimStorePlain]: treesize reduction 77, result has 62.1 percent of original size [2019-11-22 13:59:47,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 13:59:47,762 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:261, output treesize:14 [2019-11-22 13:59:47,790 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-11-22 13:59:47,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:47,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:47,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:47,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-22 13:59:47,943 INFO L343 Elim1Store]: treesize reduction 13, result has 79.4 percent of original size [2019-11-22 13:59:47,943 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 4 case distinctions, treesize of input 20 treesize of output 61 [2019-11-22 13:59:47,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:47,977 INFO L567 ElimStorePlain]: treesize reduction 23, result has 54.9 percent of original size [2019-11-22 13:59:47,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:47,978 INFO L496 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-11-22 13:59:47,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:28 [2019-11-22 13:59:47,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:48,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:48,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:48,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:48,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:48,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:48,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2019-11-22 13:59:48,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920964375] [2019-11-22 13:59:48,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-22 13:59:48,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-22 13:59:48,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-11-22 13:59:48,136 INFO L87 Difference]: Start difference. First operand 333 states and 393 transitions. Second operand 24 states. [2019-11-22 14:00:29,485 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-11-22 14:00:40,496 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-11-22 14:00:42,230 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-11-22 14:00:43,461 WARN L192 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-11-22 14:01:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:40,923 INFO L93 Difference]: Finished difference Result 354 states and 411 transitions. [2019-11-22 14:01:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-22 14:01:40,924 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-11-22 14:01:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:40,925 INFO L225 Difference]: With dead ends: 354 [2019-11-22 14:01:40,925 INFO L226 Difference]: Without dead ends: 354 [2019-11-22 14:01:40,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 14:01:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-22 14:01:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 332. [2019-11-22 14:01:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-22 14:01:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 392 transitions. [2019-11-22 14:01:40,933 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 392 transitions. Word has length 64 [2019-11-22 14:01:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:40,934 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 392 transitions. [2019-11-22 14:01:40,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-22 14:01:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 392 transitions. [2019-11-22 14:01:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-22 14:01:40,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:40,935 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:41,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:01:41,139 INFO L410 AbstractCegarLoop]: === Iteration 29 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:01:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1152340356, now seen corresponding path program 1 times [2019-11-22 14:01:41,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:01:41,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750342351] [2019-11-22 14:01:41,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:01:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-22 14:01:41,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750342351] [2019-11-22 14:01:41,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:41,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-22 14:01:41,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132024615] [2019-11-22 14:01:41,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 14:01:41,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:01:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 14:01:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:01:41,426 INFO L87 Difference]: Start difference. First operand 332 states and 392 transitions. Second operand 11 states. [2019-11-22 14:01:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:42,307 INFO L93 Difference]: Finished difference Result 369 states and 423 transitions. [2019-11-22 14:01:42,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:01:42,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-11-22 14:01:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:42,311 INFO L225 Difference]: With dead ends: 369 [2019-11-22 14:01:42,311 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 14:01:42,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-22 14:01:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 14:01:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 328. [2019-11-22 14:01:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-22 14:01:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 379 transitions. [2019-11-22 14:01:42,320 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 379 transitions. Word has length 73 [2019-11-22 14:01:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:42,320 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 379 transitions. [2019-11-22 14:01:42,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 14:01:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 379 transitions. [2019-11-22 14:01:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-22 14:01:42,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:42,322 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:42,322 INFO L410 AbstractCegarLoop]: === Iteration 30 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:01:42,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash -169295363, now seen corresponding path program 1 times [2019-11-22 14:01:42,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:01:42,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176959135] [2019-11-22 14:01:42,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:01:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:43,626 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-11-22 14:01:43,871 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-11-22 14:01:44,075 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-11-22 14:01:44,452 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2019-11-22 14:01:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:01:44,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176959135] [2019-11-22 14:01:44,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9438380] [2019-11-22 14:01:44,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:01:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:44,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-22 14:01:44,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:44,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 14:01:44,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:44,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:44,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:01:44,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-22 14:01:44,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:44,898 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-11-22 14:01:44,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:44,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:44,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:01:44,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-22 14:01:45,108 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 9 treesize of output 3 [2019-11-22 14:01:45,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:45,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:45,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:01:45,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2019-11-22 14:01:45,376 INFO L343 Elim1Store]: treesize reduction 25, result has 74.7 percent of original size [2019-11-22 14:01:45,377 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 4 case distinctions, treesize of input 24 treesize of output 85 [2019-11-22 14:01:45,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:45,421 INFO L567 ElimStorePlain]: treesize reduction 35, result has 55.1 percent of original size [2019-11-22 14:01:45,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:45,422 INFO L496 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-11-22 14:01:45,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:43 [2019-11-22 14:01:45,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:45,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:45,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:45,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:45,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:45,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:45,825 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 25 treesize of output 13 [2019-11-22 14:01:45,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:45,836 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-22 14:01:45,837 INFO L496 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-11-22 14:01:45,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-11-22 14:01:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:45,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:01:45,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 45 [2019-11-22 14:01:45,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779469514] [2019-11-22 14:01:45,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-22 14:01:45,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:01:45,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-22 14:01:45,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1841, Unknown=0, NotChecked=0, Total=2070 [2019-11-22 14:01:45,911 INFO L87 Difference]: Start difference. First operand 328 states and 379 transitions. Second operand 46 states. [2019-11-22 14:01:46,183 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-22 14:01:46,378 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-11-22 14:01:46,575 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-22 14:01:46,903 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-22 14:01:47,782 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-22 14:01:47,965 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-11-22 14:01:48,188 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-11-22 14:01:48,392 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-22 14:01:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:50,733 INFO L93 Difference]: Finished difference Result 355 states and 401 transitions. [2019-11-22 14:01:50,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-22 14:01:50,734 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 65 [2019-11-22 14:01:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:50,736 INFO L225 Difference]: With dead ends: 355 [2019-11-22 14:01:50,736 INFO L226 Difference]: Without dead ends: 355 [2019-11-22 14:01:50,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=751, Invalid=3941, Unknown=0, NotChecked=0, Total=4692 [2019-11-22 14:01:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-22 14:01:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 328. [2019-11-22 14:01:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-22 14:01:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 378 transitions. [2019-11-22 14:01:50,746 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 378 transitions. Word has length 65 [2019-11-22 14:01:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:50,747 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 378 transitions. [2019-11-22 14:01:50,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-22 14:01:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 378 transitions. [2019-11-22 14:01:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-22 14:01:50,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:50,749 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:50,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:01:50,953 INFO L410 AbstractCegarLoop]: === Iteration 31 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:01:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 515916095, now seen corresponding path program 1 times [2019-11-22 14:01:50,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:01:50,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761573642] [2019-11-22 14:01:50,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:01:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:51,702 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 31 [2019-11-22 14:01:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:52,520 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 27 [2019-11-22 14:01:53,180 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 34 [2019-11-22 14:01:53,913 WARN L192 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 30 [2019-11-22 14:01:54,863 WARN L192 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 45 [2019-11-22 14:01:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 14:01:55,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761573642] [2019-11-22 14:01:55,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316482287] [2019-11-22 14:01:55,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:01:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:55,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-22 14:01:55,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:55,628 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 14:01:55,629 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 14:01:55,629 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 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 14:01:55,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:55,687 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-11-22 14:01:55,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:55,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:55,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:58 [2019-11-22 14:01:55,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:55,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:55,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:55,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:56,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:56,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 40 treesize of output 148 [2019-11-22 14:01:56,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:56,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:56,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 37 treesize of output 137 [2019-11-22 14:01:56,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,195 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:56,196 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,202 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:56,202 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,204 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:56,205 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,208 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:56,208 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,211 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:56,211 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,226 INFO L567 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-11-22 14:01:56,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,227 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:271, output treesize:7 [2019-11-22 14:01:56,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:56,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:56,689 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-22 14:01:56,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:56,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 47 treesize of output 319 [2019-11-22 14:01:56,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:56,939 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:01:56,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:56,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 45 treesize of output 252 [2019-11-22 14:01:56,942 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:56,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:57,188 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:01:57,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:57,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 45 treesize of output 252 [2019-11-22 14:01:57,190 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:57,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:57,461 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:01:57,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:57,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 14:01:57,464 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:57,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:57,714 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:01:57,715 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:57,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 14:01:57,717 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:57,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:57,965 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:01:57,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:57,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 14:01:57,968 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:58,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:58,175 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:01:58,175 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:58,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 14:01:58,177 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:58,599 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-11-22 14:01:58,599 INFO L567 ElimStorePlain]: treesize reduction 874, result has 22.9 percent of original size [2019-11-22 14:01:58,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-22 14:01:58,600 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:306, output treesize:89 [2019-11-22 14:01:58,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:58,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:58,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 64 [2019-11-22 14:01:58,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:58,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:58,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:58,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:58,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 64 [2019-11-22 14:01:58,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:58,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:58,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 14:01:58,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:23 [2019-11-22 14:01:58,873 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-11-22 14:01:58,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:58,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:58,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:01:58,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-22 14:01:59,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:59,255 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-22 14:01:59,256 INFO L343 Elim1Store]: treesize reduction 26, result has 82.6 percent of original size [2019-11-22 14:01:59,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 145 [2019-11-22 14:01:59,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:59,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:59,490 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-22 14:01:59,490 INFO L343 Elim1Store]: treesize reduction 26, result has 82.6 percent of original size [2019-11-22 14:01:59,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 145 [2019-11-22 14:01:59,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:59,696 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-11-22 14:01:59,697 INFO L567 ElimStorePlain]: treesize reduction 120, result has 39.7 percent of original size [2019-11-22 14:01:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-22 14:01:59,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:79 [2019-11-22 14:01:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:00,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:02:00,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 32 [2019-11-22 14:02:00,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410090434] [2019-11-22 14:02:00,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-22 14:02:00,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:02:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-22 14:02:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2019-11-22 14:02:00,037 INFO L87 Difference]: Start difference. First operand 328 states and 378 transitions. Second operand 33 states. [2019-11-22 14:02:00,305 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-11-22 14:02:00,692 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2019-11-22 14:02:01,032 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2019-11-22 14:02:01,453 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 14:02:02,553 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-11-22 14:02:02,909 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-11-22 14:02:03,395 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-11-22 14:02:03,695 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-22 14:02:04,081 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-11-22 14:02:04,351 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-11-22 14:02:04,622 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-11-22 14:02:05,397 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-11-22 14:02:05,665 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-11-22 14:02:06,076 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-11-22 14:02:06,324 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-11-22 14:02:07,029 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-11-22 14:02:07,480 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-22 14:02:07,956 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-22 14:02:08,254 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-11-22 14:02:08,685 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-22 14:02:09,007 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2019-11-22 14:02:09,340 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 110 [2019-11-22 14:02:09,805 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 111 [2019-11-22 14:02:10,109 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-11-22 14:02:10,454 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-11-22 14:02:10,747 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-11-22 14:02:11,167 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-11-22 14:02:11,458 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-11-22 14:02:12,115 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-22 14:02:12,609 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-11-22 14:02:12,880 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-11-22 14:02:13,352 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-11-22 14:02:15,181 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-11-22 14:02:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:16,058 INFO L93 Difference]: Finished difference Result 357 states and 402 transitions. [2019-11-22 14:02:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-22 14:02:16,059 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-11-22 14:02:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:16,061 INFO L225 Difference]: With dead ends: 357 [2019-11-22 14:02:16,061 INFO L226 Difference]: Without dead ends: 357 [2019-11-22 14:02:16,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=827, Invalid=4575, Unknown=0, NotChecked=0, Total=5402 [2019-11-22 14:02:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-22 14:02:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 332. [2019-11-22 14:02:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-22 14:02:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 382 transitions. [2019-11-22 14:02:16,069 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 382 transitions. Word has length 67 [2019-11-22 14:02:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:16,070 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 382 transitions. [2019-11-22 14:02:16,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-22 14:02:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 382 transitions. [2019-11-22 14:02:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-22 14:02:16,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:16,072 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:16,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:02:16,284 INFO L410 AbstractCegarLoop]: === Iteration 32 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:16,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1478886374, now seen corresponding path program 1 times [2019-11-22 14:02:16,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:02:16,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864276991] [2019-11-22 14:02:16,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:02:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-22 14:02:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-22 14:02:16,382 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-22 14:02:16,382 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-22 14:02:16,416 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-22 14:02:16,424 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## [2019-11-22 14:02:16,424 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## [2019-11-22 14:02:16,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:02:16 BoogieIcfgContainer [2019-11-22 14:02:16,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:02:16,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:02:16,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:02:16,492 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:02:16,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:46" (3/4) ... [2019-11-22 14:02:16,499 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-22 14:02:16,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:02:16,500 INFO L168 Benchmark]: Toolchain (without parser) took 511509.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:02:16,500 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:02:16,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:02:16,501 INFO L168 Benchmark]: Boogie Preprocessor took 89.36 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-11-22 14:02:16,501 INFO L168 Benchmark]: RCFGBuilder took 800.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.9 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. [2019-11-22 14:02:16,501 INFO L168 Benchmark]: TraceAbstraction took 509937.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -112.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:02:16,502 INFO L168 Benchmark]: Witness Printer took 8.00 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-11-22 14:02:16,502 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 669.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 800.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.9 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 509937.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -112.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 8.00 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. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [\old(commands)=null, \old(commands)=null, \old(global)=120, \old(global)=117, \old(state)=109, commands={7:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={4:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={4:0}, input={4:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={4:0}, input={4:0}, state=0] [L722] RET parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L723] CALL parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={9:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={9:0}, input={9:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={9:0}, input={9:0}, state=0] [L723] RET parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L724] CALL parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={10:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].state_needed=0, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L695] CALL commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L702] char *x = (char *)malloc(sizeof(char)); VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L703] COND FALSE !(!x) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, malloc(sizeof(char))={1:0}, state=1, x={1:0}] [L695] RET commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={1:0}, i=0, input={10:0}, input={10:0}, state=1] [L724] RET parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, state=1] [L725] return 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, \result=0, commands={7:0}, global={1:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 79 locations, 20 error locations. Result: UNSAFE, OverallTime: 509.8s, OverallIterations: 32, TraceHistogramMax: 5, AutomataDifference: 434.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1566 SDtfs, 10663 SDslu, 2858 SDs, 0 SdLazy, 15878 SolverSat, 4080 SolverUnsat, 90 SolverUnknown, 0 SolverNotchecked, 203.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1497 GetRequests, 790 SyntacticMatches, 83 SemanticMatches, 624 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6493 ImplicationChecksByTransitivity, 139.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 880 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 66.5s InterpolantComputationTime, 1977 NumberOfCodeBlocks, 1977 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1853 ConstructedInterpolants, 250 QuantifiedInterpolants, 1750916 SizeOfPredicates, 206 NumberOfNonLiveVariables, 6738 ConjunctsInSsa, 542 ConjunctsInUnsatCore, 49 InterpolantComputations, 13 PerfectInterpolantSequences, 541/983 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... ### Bit-precise run ### This is Ultimate 0.1.24-3d056a1 [2019-11-22 14:02:18,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:02:18,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:02:18,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:02:18,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:02:18,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:02:18,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:02:18,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:02:18,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:02:18,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:02:18,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:02:18,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:02:18,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:02:18,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:02:18,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:02:18,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:02:18,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:02:18,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:02:18,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:02:18,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:02:18,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:02:18,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:02:18,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:02:18,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:02:18,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:02:18,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:02:18,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:02:18,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:02:18,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:02:18,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:02:18,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:02:18,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:02:18,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:02:18,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:02:18,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:02:18,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:02:18,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:02:18,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:02:18,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:02:18,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:02:18,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:02:18,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 14:02:18,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:02:18,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:02:18,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:02:18,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:02:18,439 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:02:18,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:02:18,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:02:18,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:02:18,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:02:18,442 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:02:18,443 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:02:18,443 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:02:18,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:02:18,444 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:02:18,444 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 14:02:18,444 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 14:02:18,445 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:02:18,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:02:18,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:02:18,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:02:18,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:02:18,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:02:18,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:02:18,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:02:18,448 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 14:02:18,448 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 14:02:18,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 14:02:18,449 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2019-11-22 14:02:18,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:02:18,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:02:18,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:02:18,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:02:18,742 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:02:18,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 14:02:18,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26aabb0e/6179e7d7610c43e8908007c1d9ab359f/FLAG943ba2ff2 [2019-11-22 14:02:19,335 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:02:19,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 14:02:19,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26aabb0e/6179e7d7610c43e8908007c1d9ab359f/FLAG943ba2ff2 [2019-11-22 14:02:19,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26aabb0e/6179e7d7610c43e8908007c1d9ab359f [2019-11-22 14:02:19,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:02:19,679 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:02:19,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:02:19,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:02:19,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:02:19,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:02:19" (1/1) ... [2019-11-22 14:02:19,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a23c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:19, skipping insertion in model container [2019-11-22 14:02:19,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:02:19" (1/1) ... [2019-11-22 14:02:19,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:02:19,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:02:20,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:02:20,191 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:02:20,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:02:20,339 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:02:20,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20 WrapperNode [2019-11-22 14:02:20,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:02:20,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:02:20,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:02:20,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:02:20,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (1/1) ... [2019-11-22 14:02:20,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (1/1) ... [2019-11-22 14:02:20,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (1/1) ... [2019-11-22 14:02:20,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (1/1) ... [2019-11-22 14:02:20,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (1/1) ... [2019-11-22 14:02:20,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (1/1) ... [2019-11-22 14:02:20,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (1/1) ... [2019-11-22 14:02:20,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:02:20,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:02:20,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:02:20,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:02:20,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-22 14:02:20,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:02:20,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:02:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 14:02:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 14:02:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 14:02:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 14:02:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 14:02:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 14:02:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 14:02:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:02:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 14:02:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 14:02:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 14:02:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 14:02:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 14:02:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 14:02:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 14:02:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 14:02:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 14:02:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 14:02:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 14:02:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 14:02:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 14:02:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 14:02:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 14:02:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 14:02:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 14:02:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 14:02:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 14:02:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 14:02:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 14:02:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 14:02:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 14:02:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 14:02:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 14:02:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 14:02:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 14:02:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 14:02:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 14:02:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 14:02:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 14:02:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 14:02:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 14:02:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 14:02:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 14:02:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 14:02:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 14:02:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 14:02:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 14:02:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 14:02:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 14:02:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 14:02:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 14:02:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 14:02:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 14:02:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 14:02:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 14:02:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 14:02:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 14:02:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 14:02:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 14:02:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 14:02:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 14:02:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:02:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 14:02:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:02:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 14:02:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 14:02:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 14:02:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 14:02:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 14:02:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 14:02:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 14:02:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 14:02:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 14:02:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 14:02:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 14:02:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 14:02:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 14:02:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 14:02:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 14:02:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 14:02:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 14:02:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 14:02:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 14:02:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 14:02:20,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 14:02:20,523 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 14:02:20,523 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 14:02:20,523 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 14:02:20,523 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 14:02:20,524 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 14:02:20,524 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 14:02:20,524 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 14:02:20,524 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 14:02:20,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 14:02:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 14:02:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 14:02:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 14:02:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 14:02:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 14:02:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 14:02:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 14:02:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 14:02:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 14:02:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 14:02:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 14:02:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 14:02:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 14:02:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 14:02:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 14:02:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 14:02:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 14:02:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 14:02:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 14:02:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 14:02:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 14:02:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 14:02:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 14:02:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 14:02:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 14:02:20,530 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 14:02:20,530 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 14:02:20,530 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 14:02:20,530 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 14:02:20,530 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 14:02:20,531 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 14:02:20,531 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 14:02:20,531 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 14:02:20,531 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 14:02:20,531 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 14:02:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 14:02:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 14:02:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 14:02:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 14:02:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 14:02:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 14:02:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 14:02:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 14:02:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 14:02:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 14:02:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 14:02:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 14:02:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 14:02:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 14:02:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 14:02:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 14:02:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 14:02:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 14:02:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 14:02:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 14:02:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 14:02:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 14:02:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 14:02:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 14:02:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 14:02:20,537 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 14:02:20,537 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 14:02:20,537 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 14:02:20,537 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 14:02:20,537 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 14:02:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 14:02:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 14:02:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 14:02:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 14:02:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 14:02:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 14:02:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 14:02:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 14:02:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:02:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:02:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:02:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:02:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 14:02:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 14:02:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:02:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 14:02:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 14:02:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 14:02:21,308 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:02:21,308 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 14:02:21,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:02:21 BoogieIcfgContainer [2019-11-22 14:02:21,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:02:21,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:02:21,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:02:21,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:02:21,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:02:19" (1/3) ... [2019-11-22 14:02:21,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cc7658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:02:21, skipping insertion in model container [2019-11-22 14:02:21,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:02:20" (2/3) ... [2019-11-22 14:02:21,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cc7658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:02:21, skipping insertion in model container [2019-11-22 14:02:21,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:02:21" (3/3) ... [2019-11-22 14:02:21,323 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-22 14:02:21,332 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:02:21,339 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 14:02:21,354 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 14:02:21,372 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:02:21,372 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:02:21,373 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:02:21,373 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:02:21,373 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:02:21,373 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:02:21,373 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:02:21,373 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:02:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 14:02:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 14:02:21,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:21,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:21,401 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-22 14:02:21,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:21,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1156230762] [2019-11-22 14:02:21,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:21,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 14:02:21,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:22,182 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 14:02:22,185 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 14:02:22,186 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 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 14:02:22,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:22,285 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 14:02:22,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:22,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:22,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 14:02:22,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:22,354 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:22,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1156230762] [2019-11-22 14:02:22,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:22,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 14:02:22,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173146485] [2019-11-22 14:02:22,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:02:22,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:02:22,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:02:22,416 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-22 14:02:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:22,582 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-11-22 14:02:22,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:02:22,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 14:02:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:22,596 INFO L225 Difference]: With dead ends: 93 [2019-11-22 14:02:22,596 INFO L226 Difference]: Without dead ends: 87 [2019-11-22 14:02:22,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:02:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-22 14:02:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-22 14:02:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-22 14:02:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-11-22 14:02:22,649 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 9 [2019-11-22 14:02:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:22,650 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-11-22 14:02:22,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:02:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-11-22 14:02:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 14:02:22,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:22,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:22,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:22,859 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:22,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:22,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-22 14:02:22,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:22,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [414033779] [2019-11-22 14:02:22,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:23,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 14:02:23,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:23,640 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 14:02:23,641 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 14:02:23,642 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 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 14:02:23,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:23,795 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 14:02:23,796 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 14:02:23,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:02:23,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 14:02:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:23,830 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:24,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [414033779] [2019-11-22 14:02:24,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:24,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 14:02:24,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093998128] [2019-11-22 14:02:24,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:02:24,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:24,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:02:24,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:02:24,075 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 6 states. [2019-11-22 14:02:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:24,556 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2019-11-22 14:02:24,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:02:24,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 14:02:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:24,561 INFO L225 Difference]: With dead ends: 172 [2019-11-22 14:02:24,561 INFO L226 Difference]: Without dead ends: 172 [2019-11-22 14:02:24,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:02:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-22 14:02:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2019-11-22 14:02:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-22 14:02:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-11-22 14:02:24,589 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 9 [2019-11-22 14:02:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:24,590 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-11-22 14:02:24,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:02:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-11-22 14:02:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:02:24,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:24,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:24,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:24,795 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-22 14:02:24,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:24,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1084470754] [2019-11-22 14:02:24,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:25,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 14:02:25,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:25,694 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 14:02:25,695 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 14:02:25,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 325 treesize of output 419 [2019-11-22 14:02:25,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:25,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:26,750 WARN L192 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-22 14:02:26,752 INFO L567 ElimStorePlain]: treesize reduction 6909, result has 2.3 percent of original size [2019-11-22 14:02:26,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:26,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:26,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:146, output treesize:166 [2019-11-22 14:02:26,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:26,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:26,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:26,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:27,272 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-11-22 14:02:27,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 44 [2019-11-22 14:02:27,305 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:27,431 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-22 14:02:27,432 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.3 percent of original size [2019-11-22 14:02:27,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:27,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:124, output treesize:70 [2019-11-22 14:02:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:27,478 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:27,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1084470754] [2019-11-22 14:02:27,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:27,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 14:02:27,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591118671] [2019-11-22 14:02:27,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:02:27,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:02:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:02:27,815 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 8 states. [2019-11-22 14:02:28,304 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 14:02:28,600 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-11-22 14:02:29,195 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-11-22 14:02:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:29,785 INFO L93 Difference]: Finished difference Result 292 states and 423 transitions. [2019-11-22 14:02:29,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 14:02:29,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 14:02:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:29,790 INFO L225 Difference]: With dead ends: 292 [2019-11-22 14:02:29,790 INFO L226 Difference]: Without dead ends: 292 [2019-11-22 14:02:29,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:02:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-22 14:02:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 226. [2019-11-22 14:02:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-22 14:02:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 339 transitions. [2019-11-22 14:02:29,820 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 339 transitions. Word has length 10 [2019-11-22 14:02:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:29,821 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 339 transitions. [2019-11-22 14:02:29,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:02:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 339 transitions. [2019-11-22 14:02:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 14:02:29,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:29,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:30,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:30,027 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-22 14:02:30,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:30,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [945476575] [2019-11-22 14:02:30,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:30,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 14:02:30,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:30,439 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_69|]} [2019-11-22 14:02:30,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:30,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:30,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:30,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:30,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:30,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:30,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:30,776 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 14:02:30,777 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 14:02:30,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 141 [2019-11-22 14:02:30,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:31,007 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 14:02:31,007 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 14:02:31,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:31,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 288 [2019-11-22 14:02:31,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:31,960 WARN L192 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 68 [2019-11-22 14:02:31,961 INFO L567 ElimStorePlain]: treesize reduction 2940, result has 5.0 percent of original size [2019-11-22 14:02:31,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:31,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 14:02:31,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:31,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:32,128 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:02:32,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:32,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2019-11-22 14:02:32,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:32,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 14:02:32,187 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:32,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2019-11-22 14:02:32,218 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,240 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 14:02:32,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 14:02:32,242 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,272 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:32,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 14:02:32,273 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,285 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:02:32,285 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2019-11-22 14:02:32,317 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,325 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:02:32,325 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2019-11-22 14:02:32,347 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:32,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 131 [2019-11-22 14:02:32,377 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:32,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 14:02:32,397 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:32,861 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 14:02:32,862 INFO L567 ElimStorePlain]: treesize reduction 698, result has 31.2 percent of original size [2019-11-22 14:02:32,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-22 14:02:32,864 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1531, output treesize:316 [2019-11-22 14:02:33,141 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 14:02:33,386 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 14:02:33,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:02:33,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2019-11-22 14:02:33,428 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:33,633 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 14:02:33,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:33,650 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 58 treesize of output 50 [2019-11-22 14:02:33,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:33,808 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-22 14:02:33,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:33,823 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 81 treesize of output 73 [2019-11-22 14:02:33,824 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:34,020 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 14:02:34,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:34,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 58 [2019-11-22 14:02:34,032 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:34,162 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 14:02:34,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:34,178 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 53 treesize of output 45 [2019-11-22 14:02:34,179 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:34,297 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 14:02:34,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:34,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2019-11-22 14:02:34,308 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:34,431 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-22 14:02:34,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:34,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-22 14:02:34,433 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:249, output treesize:129 [2019-11-22 14:02:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:34,545 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:34,771 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 14:02:34,990 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 14:02:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:35,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [945476575] [2019-11-22 14:02:35,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:35,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 14:02:35,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946462492] [2019-11-22 14:02:35,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 14:02:35,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:35,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 14:02:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:02:35,106 INFO L87 Difference]: Start difference. First operand 226 states and 339 transitions. Second operand 9 states. [2019-11-22 14:02:35,397 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-11-22 14:02:35,753 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 91 [2019-11-22 14:02:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:37,161 INFO L93 Difference]: Finished difference Result 412 states and 600 transitions. [2019-11-22 14:02:37,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:02:37,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 14:02:37,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:37,168 INFO L225 Difference]: With dead ends: 412 [2019-11-22 14:02:37,168 INFO L226 Difference]: Without dead ends: 412 [2019-11-22 14:02:37,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 14:02:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-22 14:02:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 343. [2019-11-22 14:02:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-22 14:02:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 545 transitions. [2019-11-22 14:02:37,206 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 545 transitions. Word has length 11 [2019-11-22 14:02:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:37,206 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 545 transitions. [2019-11-22 14:02:37,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 14:02:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 545 transitions. [2019-11-22 14:02:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 14:02:37,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:37,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:37,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:37,413 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:37,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-22 14:02:37,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:37,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [672946327] [2019-11-22 14:02:37,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:37,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:02:37,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:38,226 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-11-22 14:02:38,227 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 14:02:38,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1568 treesize of output 1562 [2019-11-22 14:02:38,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:38,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:39,502 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 229 DAG size of output: 64 [2019-11-22 14:02:39,502 INFO L567 ElimStorePlain]: treesize reduction 58523, result has 0.2 percent of original size [2019-11-22 14:02:39,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:39,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:39,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:103 [2019-11-22 14:02:39,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:39,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:39,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:39,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:39,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:02:40,026 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-22 14:02:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:40,170 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:40,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [672946327] [2019-11-22 14:02:40,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:40,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 14:02:40,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607453253] [2019-11-22 14:02:40,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:02:40,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:40,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:02:40,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:02:40,422 INFO L87 Difference]: Start difference. First operand 343 states and 545 transitions. Second operand 10 states. [2019-11-22 14:02:41,422 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-22 14:02:42,300 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-22 14:02:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:43,347 INFO L93 Difference]: Finished difference Result 433 states and 653 transitions. [2019-11-22 14:02:43,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:02:43,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 14:02:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:43,354 INFO L225 Difference]: With dead ends: 433 [2019-11-22 14:02:43,354 INFO L226 Difference]: Without dead ends: 433 [2019-11-22 14:02:43,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:02:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-22 14:02:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 381. [2019-11-22 14:02:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-22 14:02:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 599 transitions. [2019-11-22 14:02:43,385 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 599 transitions. Word has length 12 [2019-11-22 14:02:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:43,385 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 599 transitions. [2019-11-22 14:02:43,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:02:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 599 transitions. [2019-11-22 14:02:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 14:02:43,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:43,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:43,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:43,591 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-22 14:02:43,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:43,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1108022173] [2019-11-22 14:02:43,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:43,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 14:02:43,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:43,981 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_85|]} [2019-11-22 14:02:44,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,050 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 14:02:44,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 14:02:44,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:44,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:44,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:44,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:44,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 158 [2019-11-22 14:02:44,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:44,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:44,381 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-22 14:02:44,382 INFO L567 ElimStorePlain]: treesize reduction 166, result has 27.2 percent of original size [2019-11-22 14:02:44,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:44,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 14:02:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:44,555 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:44,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1108022173] [2019-11-22 14:02:44,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:44,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 14:02:44,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675319703] [2019-11-22 14:02:44,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:02:44,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:44,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:02:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:02:44,796 INFO L87 Difference]: Start difference. First operand 381 states and 599 transitions. Second operand 8 states. [2019-11-22 14:02:44,985 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-22 14:02:48,570 WARN L192 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 14:02:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:49,795 INFO L93 Difference]: Finished difference Result 441 states and 624 transitions. [2019-11-22 14:02:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:02:49,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 14:02:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:49,806 INFO L225 Difference]: With dead ends: 441 [2019-11-22 14:02:49,806 INFO L226 Difference]: Without dead ends: 441 [2019-11-22 14:02:49,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:02:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-22 14:02:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 383. [2019-11-22 14:02:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-22 14:02:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 595 transitions. [2019-11-22 14:02:49,854 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 595 transitions. Word has length 13 [2019-11-22 14:02:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:49,854 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 595 transitions. [2019-11-22 14:02:49,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:02:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 595 transitions. [2019-11-22 14:02:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:02:49,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:49,856 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:50,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:50,071 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-22 14:02:50,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:50,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1846867004] [2019-11-22 14:02:50,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-22 14:02:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:50,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 14:02:50,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:50,730 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 15=[|v_#valid_93|]} [2019-11-22 14:02:50,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:50,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:50,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:50,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:50,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:50,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:50,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:50,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:50,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:51,024 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-22 14:02:51,026 INFO L343 Elim1Store]: treesize reduction 28, result has 81.1 percent of original size [2019-11-22 14:02:51,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-22 14:02:51,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:51,231 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-22 14:02:51,231 INFO L567 ElimStorePlain]: treesize reduction 62, result has 69.9 percent of original size [2019-11-22 14:02:51,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:51,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 402 [2019-11-22 14:02:51,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:51,416 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:52,467 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 248 DAG size of output: 64 [2019-11-22 14:02:52,468 INFO L567 ElimStorePlain]: treesize reduction 7690, result has 1.6 percent of original size [2019-11-22 14:02:52,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:52,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:109, output treesize:129 [2019-11-22 14:02:52,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:53,096 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-22 14:02:53,594 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 14:02:53,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:53,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2019-11-22 14:02:53,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:53,935 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-11-22 14:02:53,935 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.9 percent of original size [2019-11-22 14:02:53,948 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 72 treesize of output 56 [2019-11-22 14:02:53,949 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:54,050 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-22 14:02:54,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:54,063 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 63 treesize of output 55 [2019-11-22 14:02:54,064 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:54,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:54,161 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 52 treesize of output 44 [2019-11-22 14:02:54,161 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:54,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:54,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 14:02:54,239 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:195, output treesize:92 [2019-11-22 14:02:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:54,315 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:54,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1846867004] [2019-11-22 14:02:54,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:02:54,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-22 14:02:54,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569549149] [2019-11-22 14:02:54,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:02:54,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:54,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:02:54,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:02:54,748 INFO L87 Difference]: Start difference. First operand 383 states and 595 transitions. Second operand 10 states. [2019-11-22 14:02:55,511 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-11-22 14:02:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:57,554 INFO L93 Difference]: Finished difference Result 520 states and 767 transitions. [2019-11-22 14:02:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 14:02:57,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 14:02:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:57,560 INFO L225 Difference]: With dead ends: 520 [2019-11-22 14:02:57,560 INFO L226 Difference]: Without dead ends: 520 [2019-11-22 14:02:57,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-22 14:02:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-11-22 14:02:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 421. [2019-11-22 14:02:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-22 14:02:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 658 transitions. [2019-11-22 14:02:57,581 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 658 transitions. Word has length 19 [2019-11-22 14:02:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:57,582 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 658 transitions. [2019-11-22 14:02:57,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:02:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 658 transitions. [2019-11-22 14:02:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 14:02:57,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:57,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:57,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:57,788 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:57,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:57,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1646608229, now seen corresponding path program 1 times [2019-11-22 14:02:57,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:57,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [870163653] [2019-11-22 14:02:57,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:58,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 14:02:58,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:58,056 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:58,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [870163653] [2019-11-22 14:02:58,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:58,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 14:02:58,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252669927] [2019-11-22 14:02:58,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:02:58,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:58,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:02:58,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:02:58,062 INFO L87 Difference]: Start difference. First operand 421 states and 658 transitions. Second operand 3 states. [2019-11-22 14:02:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:58,067 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2019-11-22 14:02:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:02:58,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 14:02:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:58,069 INFO L225 Difference]: With dead ends: 322 [2019-11-22 14:02:58,070 INFO L226 Difference]: Without dead ends: 322 [2019-11-22 14:02:58,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:02:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-22 14:02:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2019-11-22 14:02:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-22 14:02:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 464 transitions. [2019-11-22 14:02:58,082 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 464 transitions. Word has length 23 [2019-11-22 14:02:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:58,082 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 464 transitions. [2019-11-22 14:02:58,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:02:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 464 transitions. [2019-11-22 14:02:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 14:02:58,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:58,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:58,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:58,287 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash -407602741, now seen corresponding path program 1 times [2019-11-22 14:02:58,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:58,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [668296376] [2019-11-22 14:02:58,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:58,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 14:02:58,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:58,547 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:58,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-11-22 14:02:58,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [668296376] [2019-11-22 14:02:58,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:58,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 14:02:58,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968809280] [2019-11-22 14:02:58,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:02:58,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:02:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:02:58,562 INFO L87 Difference]: Start difference. First operand 317 states and 464 transitions. Second operand 3 states. [2019-11-22 14:02:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:58,587 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2019-11-22 14:02:58,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:02:58,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-22 14:02:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:58,591 INFO L225 Difference]: With dead ends: 421 [2019-11-22 14:02:58,592 INFO L226 Difference]: Without dead ends: 421 [2019-11-22 14:02:58,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:02:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-22 14:02:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2019-11-22 14:02:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-22 14:02:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 619 transitions. [2019-11-22 14:02:58,616 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 619 transitions. Word has length 24 [2019-11-22 14:02:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:58,618 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 619 transitions. [2019-11-22 14:02:58,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:02:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 619 transitions. [2019-11-22 14:02:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 14:02:58,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:58,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:58,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:58,833 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash 249216982, now seen corresponding path program 1 times [2019-11-22 14:02:58,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:58,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [523965912] [2019-11-22 14:02:58,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:59,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 14:02:59,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:59,089 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:59,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [523965912] [2019-11-22 14:02:59,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:02:59,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 14:02:59,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900422476] [2019-11-22 14:02:59,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:02:59,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:59,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:02:59,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:02:59,098 INFO L87 Difference]: Start difference. First operand 411 states and 619 transitions. Second operand 4 states. [2019-11-22 14:02:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:59,139 INFO L93 Difference]: Finished difference Result 358 states and 502 transitions. [2019-11-22 14:02:59,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:02:59,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-22 14:02:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:59,150 INFO L225 Difference]: With dead ends: 358 [2019-11-22 14:02:59,151 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 14:02:59,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:02:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 14:02:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 342. [2019-11-22 14:02:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-22 14:02:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 491 transitions. [2019-11-22 14:02:59,164 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 491 transitions. Word has length 25 [2019-11-22 14:02:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:59,164 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 491 transitions. [2019-11-22 14:02:59,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:02:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 491 transitions. [2019-11-22 14:02:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 14:02:59,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:59,166 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:59,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:59,370 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:02:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-22 14:02:59,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:59,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [494849095] [2019-11-22 14:02:59,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:59,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 14:02:59,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:59,750 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:59,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [494849095] [2019-11-22 14:02:59,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:02:59,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 14:02:59,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531016422] [2019-11-22 14:02:59,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:02:59,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:02:59,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:02:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:02:59,802 INFO L87 Difference]: Start difference. First operand 342 states and 491 transitions. Second operand 8 states. [2019-11-22 14:02:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:59,931 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2019-11-22 14:02:59,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:02:59,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 14:02:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:59,936 INFO L225 Difference]: With dead ends: 365 [2019-11-22 14:02:59,936 INFO L226 Difference]: Without dead ends: 365 [2019-11-22 14:02:59,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:02:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-22 14:02:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2019-11-22 14:02:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-22 14:02:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 421 transitions. [2019-11-22 14:02:59,949 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 421 transitions. Word has length 25 [2019-11-22 14:02:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:59,950 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 421 transitions. [2019-11-22 14:02:59,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:02:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 421 transitions. [2019-11-22 14:02:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 14:02:59,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:59,951 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:03:00,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:03:00,155 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:03:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:03:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2031405767, now seen corresponding path program 1 times [2019-11-22 14:03:00,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:03:00,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [449405281] [2019-11-22 14:03:00,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:03:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:03:00,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 14:03:00,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:03:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:03:00,401 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:03:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:03:00,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [449405281] [2019-11-22 14:03:00,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:03:00,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 14:03:00,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566037744] [2019-11-22 14:03:00,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:03:00,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:03:00,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:03:00,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:03:00,441 INFO L87 Difference]: Start difference. First operand 315 states and 421 transitions. Second operand 3 states. [2019-11-22 14:03:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:03:00,446 INFO L93 Difference]: Finished difference Result 229 states and 292 transitions. [2019-11-22 14:03:00,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:03:00,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 14:03:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:03:00,448 INFO L225 Difference]: With dead ends: 229 [2019-11-22 14:03:00,448 INFO L226 Difference]: Without dead ends: 229 [2019-11-22 14:03:00,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:03:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-22 14:03:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-11-22 14:03:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-22 14:03:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2019-11-22 14:03:00,456 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 33 [2019-11-22 14:03:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:03:00,456 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2019-11-22 14:03:00,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:03:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2019-11-22 14:03:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 14:03:00,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:03:00,458 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:03:00,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:03:00,664 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:03:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:03:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-22 14:03:00,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:03:00,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [805864507] [2019-11-22 14:03:00,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:03:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:03:01,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:03:01,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:03:01,570 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 14:03:01,570 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 14:03:01,571 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 7 case distinctions, treesize of input 72 treesize of output 110 [2019-11-22 14:03:01,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:01,709 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 14:03:01,710 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 14:03:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:03:01,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:03:01,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 14:03:01,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:03:01,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:03:01,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:03:02,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:03:02,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:03:02,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:03:02,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 14:03:02,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:02,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:03:02,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 14:03:02,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:02,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:03:02,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 14:03:02,737 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:02,749 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:03:02,749 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:02,754 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:03:02,755 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:02,760 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:03:02,760 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:02,921 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 14:03:02,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:03:02,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 14:03:02,924 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:03,027 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-22 14:03:03,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:03:03,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 14:03:03,029 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 14:03:03,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:03:03,319 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 14:03:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 14:03:03,408 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:03:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 14:03:03,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [805864507] [2019-11-22 14:03:03,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:03:03,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 14:03:03,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739213768] [2019-11-22 14:03:03,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 14:03:03,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:03:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 14:03:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:03:03,647 INFO L87 Difference]: Start difference. First operand 229 states and 292 transitions. Second operand 14 states. [2019-11-22 14:03:05,252 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 14:03:08,088 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 14:03:12,839 WARN L192 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 14:03:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:03:14,626 INFO L93 Difference]: Finished difference Result 323 states and 385 transitions. [2019-11-22 14:03:14,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:03:14,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 14:03:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:03:14,630 INFO L225 Difference]: With dead ends: 323 [2019-11-22 14:03:14,630 INFO L226 Difference]: Without dead ends: 317 [2019-11-22 14:03:14,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 14:03:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-22 14:03:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2019-11-22 14:03:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-22 14:03:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 358 transitions. [2019-11-22 14:03:14,642 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 358 transitions. Word has length 33 [2019-11-22 14:03:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:03:14,642 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 358 transitions. [2019-11-22 14:03:14,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 14:03:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2019-11-22 14:03:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 14:03:14,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:03:14,646 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:03:14,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:03:14,851 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:03:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:03:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash -330240892, now seen corresponding path program 1 times [2019-11-22 14:03:14,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:03:14,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [859877455] [2019-11-22 14:03:14,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:03:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:03:15,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 14:03:15,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:03:15,766 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 14:03:15,767 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 14:03:15,767 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 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 14:03:15,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:15,903 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 14:03:15,904 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 14:03:15,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:03:15,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 14:03:15,928 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 7 treesize of output 5 [2019-11-22 14:03:15,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:15,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:03:15,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:03:15,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 14:03:15,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:03:15,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 14:03:15,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:03:16,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:03:16,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:03:16,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 14:03:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:03:16,065 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:03:16,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:03:16,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:03:17,088 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-22 14:03:17,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:03:17,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:03:17,297 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 14:03:17,305 INFO L168 Benchmark]: Toolchain (without parser) took 57626.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.9 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -261.7 MB). Peak memory consumption was 157.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:03:17,305 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:03:17,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-22 14:03:17,306 INFO L168 Benchmark]: Boogie Preprocessor took 94.91 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-22 14:03:17,307 INFO L168 Benchmark]: RCFGBuilder took 876.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:03:17,307 INFO L168 Benchmark]: TraceAbstraction took 55990.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -175.5 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2019-11-22 14:03:17,309 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.54 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 660.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.91 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 876.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55990.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -175.5 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...